Base | Representation |
---|---|
bin | 10111001101110000010101… |
… | …111101011111000011001011 |
3 | 111101111200210121122021011011 |
4 | 113031300111331133003023 |
5 | 101340302434214000021 |
6 | 1001052124453144351 |
7 | 30335335245110401 |
oct | 2715602575370313 |
9 | 441450717567134 |
10 | 102100331000011 |
11 | 2a594564110293 |
12 | b54b88a32b0b7 |
13 | 44c803494ca36 |
14 | 1b2d97a685471 |
15 | bc0ce5abade1 |
hex | 5cdc15f5f0cb |
102100331000011 has 8 divisors (see below), whose sum is σ = 102421126922240. Its totient is φ = 101779854758208.
The previous prime is 102100330999967. The next prime is 102100331000021. The reversal of 102100331000011 is 110000133001201.
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 102100331000011 - 225 = 102100297445579 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102100330999955 and 102100331000000.
It is not an unprimeable number, because it can be changed into a prime (102100331000021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 79280331 + ... + 80557876.
It is an arithmetic number, because the mean of its divisors is an integer number (12802640865280).
Almost surely, 2102100331000011 is an apocalyptic number.
102100331000011 is a deficient number, since it is larger than the sum of its proper divisors (320795922229).
102100331000011 is a wasteful number, since it uses less digits than its factorization.
102100331000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159840213.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 102100331000011 its reverse (110000133001201), we get a palindrome (212100464001212).
The spelling of 102100331000011 in words is "one hundred two trillion, one hundred billion, three hundred thirty-one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •