Base | Representation |
---|---|
bin | 1011000000011011011101… |
… | …1110001000001010001101 |
3 | 1120211221101020221211112001 |
4 | 2300012313132020022031 |
5 | 3041234344224013401 |
6 | 41423325453312301 |
7 | 2356224603142324 |
oct | 260066736101215 |
9 | 46757336854461 |
10 | 12102001001101 |
11 | 3946480080720 |
12 | 1435547795691 |
13 | 69a2a193723b |
14 | 2dba506b90bb |
15 | 15ec02b69601 |
hex | b01b778828d |
12102001001101 has 8 divisors (see below), whose sum is σ = 13249165771008. Its totient is φ = 10962666708000.
The previous prime is 12102001001099. The next prime is 12102001001113. The reversal of 12102001001101 is 10110010020121.
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 12102001001101 - 21 = 12102001001099 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 (12102001001131) 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, 1957615965 + ... + 1957622146.
It is an arithmetic number, because the mean of its divisors is an integer number (1656145721376).
Almost surely, 212102001001101 is an apocalyptic number.
12102001001101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12102001001101 is a deficient number, since it is larger than the sum of its proper divisors (1147164769907).
12102001001101 is a wasteful number, since it uses less digits than its factorization.
12102001001101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3915238403.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 12102001001101 its reverse (10110010020121), we get a palindrome (22212011021222).
The spelling of 12102001001101 in words is "twelve trillion, one hundred two billion, one million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •