Base | Representation |
---|---|
bin | 10111001101111001101000… |
… | …010001110101101101011101 |
3 | 111101112122112111211122111121 |
4 | 113031321220101311231131 |
5 | 101340433344303031023 |
6 | 1001100454122250541 |
7 | 30336140321166154 |
oct | 2715715021655535 |
9 | 441478474748447 |
10 | 102110302002013 |
11 | 2a598810519708 |
12 | b5517b1656a51 |
13 | 44c8c63626316 |
14 | 1b30244a1a59b |
15 | bc11cb14bd5d |
hex | 5cde68475b5d |
102110302002013 has 16 divisors (see below), whose sum is σ = 103808482856704. Its totient is φ = 100417338584640.
The previous prime is 102110302002011. The next prime is 102110302002031. The reversal of 102110302002013 is 310200203011201.
It is a cyclic number.
It is not a de Polignac number, because 102110302002013 - 21 = 102110302002011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102110302002011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 141501148 + ... + 142220938.
It is an arithmetic number, because the mean of its divisors is an integer number (6488030178544).
Almost surely, 2102110302002013 is an apocalyptic number.
It is an amenable number.
102110302002013 is a deficient number, since it is larger than the sum of its proper divisors (1698180854691).
102110302002013 is an equidigital number, since it uses as much as digits as its factorization.
102110302002013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 723412.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102110302002013 its reverse (310200203011201), we get a palindrome (412310505013214).
The spelling of 102110302002013 in words is "one hundred two trillion, one hundred ten billion, three hundred two million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •