Base | Representation |
---|---|
bin | 101111101000110100… |
… | …0001111001111000001 |
3 | 100210001112211010222210 |
4 | 1133101220033033001 |
5 | 3134003103442423 |
6 | 114555130252333 |
7 | 10251056066601 |
oct | 1372150171701 |
9 | 323045733883 |
10 | 102301234113 |
11 | 3a42741a381 |
12 | 179b05870a9 |
13 | 98544c7530 |
14 | 4d46930c01 |
15 | 29db2a1b93 |
hex | 17d1a0f3c1 |
102301234113 has 16 divisors (see below), whose sum is σ = 146986963200. Its totient is φ = 62914798464.
The previous prime is 102301234111. The next prime is 102301234117. The reversal of 102301234113 is 311432103201.
It is not a de Polignac number, because 102301234113 - 21 = 102301234111 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 102301234113.
It is not an unprimeable number, because it can be changed into a prime (102301234111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 766788 + ... + 890261.
It is an arithmetic number, because the mean of its divisors is an integer number (9186685200).
Almost surely, 2102301234113 is an apocalyptic number.
102301234113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
102301234113 is a deficient number, since it is larger than the sum of its proper divisors (44685729087).
102301234113 is a wasteful number, since it uses less digits than its factorization.
102301234113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1658648.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 102301234113 its reverse (311432103201), we get a palindrome (413733337314).
The spelling of 102301234113 in words is "one hundred two billion, three hundred one million, two hundred thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •