Base | Representation |
---|---|
bin | 1001001100100011001100… |
… | …1101001110011111000001 |
3 | 1022210121210202110022020211 |
4 | 2103020303031032133001 |
5 | 2311130230300320001 |
6 | 33301005434434121 |
7 | 2062340155642306 |
oct | 223106315163701 |
9 | 38717722408224 |
10 | 10111212120001 |
11 | 32491607088a3 |
12 | 1173754592941 |
13 | 5846388013a5 |
14 | 26d5572b90ad |
15 | 12803866c351 |
hex | 9323334e7c1 |
10111212120001 has 8 divisors (see below), whose sum is σ = 10374548311424. Its totient is φ = 9849157370640.
The previous prime is 10111212119941. The next prime is 10111212120091. The reversal of 10111212120001 is 10002121211101.
It is a happy number.
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 10111212120001 - 237 = 9973773166529 is a prime.
It is a super-2 number, since 2×101112121200012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10111212120091) 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, 320344530 + ... + 320376091.
It is an arithmetic number, because the mean of its divisors is an integer number (1296818538928).
Almost surely, 210111212120001 is an apocalyptic number.
It is an amenable number.
10111212120001 is a deficient number, since it is larger than the sum of its proper divisors (263336191423).
10111212120001 is an equidigital number, since it uses as much as digits as its factorization.
10111212120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640721031.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10111212120001 its reverse (10002121211101), we get a palindrome (20113333331102).
The spelling of 10111212120001 in words is "ten trillion, one hundred eleven billion, two hundred twelve million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •