Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …1000000011110011000100 |
3 | 1022210121112122111021011012 |
4 | 2103020231020003303010 |
5 | 2311130023141232322 |
6 | 33300551352101352 |
7 | 2062334506544330 |
oct | 223105510036304 |
9 | 38717478437135 |
10 | 10111110102212 |
11 | 3249109069379 |
12 | 1173726394858 |
13 | 584620632332 |
14 | 26d5479207c0 |
15 | 12802e719ae2 |
hex | 9322d203cc4 |
10111110102212 has 24 divisors (see below), whose sum is σ = 20422440212160. Its totient is φ = 4290428613600.
The previous prime is 10111110102199. The next prime is 10111110102239. The reversal of 10111110102212 is 21220101111101.
It is a super-2 number, since 2×101111101022122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1787675762 + ... + 1787681417.
It is an arithmetic number, because the mean of its divisors is an integer number (850935008840).
Almost surely, 210111110102212 is an apocalyptic number.
It is an amenable number.
10111110102212 is an abundant number, since it is smaller than the sum of its proper divisors (10311330109948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111110102212 is a wasteful number, since it uses less digits than its factorization.
10111110102212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3575357291 (or 3575357289 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10111110102212 its reverse (21220101111101), we get a palindrome (31331211213313).
The spelling of 10111110102212 in words is "ten trillion, one hundred eleven billion, one hundred ten million, one hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •