Base | Representation |
---|---|
bin | 101111100000110010… |
… | …1100100101010101101 |
3 | 100202100210101201102011 |
4 | 1133001211210222231 |
5 | 3132430204200023 |
6 | 114512314001221 |
7 | 10241310353224 |
oct | 1370145445255 |
9 | 322323351364 |
10 | 102032100013 |
11 | 3a2a95079a8 |
12 | 17936416211 |
13 | 981081589c |
14 | 4d1ccb3cbb |
15 | 29c283d50d |
hex | 17c1964aad |
102032100013 has 8 divisors (see below), whose sum is σ = 107622758720. Its totient is φ = 96463496160.
The previous prime is 102032099999. The next prime is 102032100017. The reversal of 102032100013 is 310001230201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102032100013 - 225 = 101998545581 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102032099966 and 102032100002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102032100017) 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 7 ways as a sum of consecutive naturals, for example, 5504208 + ... + 5522713.
It is an arithmetic number, because the mean of its divisors is an integer number (13452844840).
Almost surely, 2102032100013 is an apocalyptic number.
It is an amenable number.
102032100013 is a deficient number, since it is larger than the sum of its proper divisors (5590658707).
102032100013 is a wasteful number, since it uses less digits than its factorization.
102032100013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11027427.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 102032100013 its reverse (310001230201), we get a palindrome (412033330214).
The spelling of 102032100013 in words is "one hundred two billion, thirty-two million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •