Base | Representation |
---|---|
bin | 10111001101111011001101… |
… | …100011110001001101101001 |
3 | 111101112210220221011220022110 |
4 | 113031323031203301031221 |
5 | 101341000334301413001 |
6 | 1001101334502112533 |
7 | 30336230403144111 |
oct | 2715731543611551 |
9 | 441483827156273 |
10 | 102112001201001 |
11 | 2a599502694aa0 |
12 | b551ba671b749 |
13 | 44c91746820cc |
14 | 1b30366574041 |
15 | bc127a3e33d6 |
hex | 5cdecd8f1369 |
102112001201001 has 8 divisors (see below), whose sum is σ = 148526547201504. Its totient is φ = 61886061333920.
The previous prime is 102112001200949. The next prime is 102112001201009. The reversal of 102112001201001 is 100102100211201.
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 102112001201001 - 229 = 102111464330089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102112001201009) 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, 1547151533316 + ... + 1547151533381.
It is an arithmetic number, because the mean of its divisors is an integer number (18565818400188).
Almost surely, 2102112001201001 is an apocalyptic number.
102112001201001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102112001201001 is a deficient number, since it is larger than the sum of its proper divisors (46414546000503).
102112001201001 is a wasteful number, since it uses less digits than its factorization.
102112001201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3094303066711.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102112001201001 its reverse (100102100211201), we get a palindrome (202214101412202).
The spelling of 102112001201001 in words is "one hundred two trillion, one hundred twelve billion, one million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •