Base | Representation |
---|---|
bin | 10110101111010101110000… |
… | …100000101011011110000100 |
3 | 111010002212210212111012210011 |
4 | 112233111300200223132010 |
5 | 101102031342440232322 |
6 | 552412015131440004 |
7 | 30031333005112102 |
oct | 2657256040533604 |
9 | 433085725435704 |
10 | 100010201102212 |
11 | 299590a7297265 |
12 | b272791bb6004 |
13 | 43a5bc96b52bb |
14 | 1a9a73b962c72 |
15 | b86765153677 |
hex | 5af57082b784 |
100010201102212 has 48 divisors (see below), whose sum is σ = 182936600985600. Its totient is φ = 47793016105632.
The previous prime is 100010201102111. The next prime is 100010201102291. The reversal of 100010201102212 is 212201102010001.
It is a junction number, because it is equal to n+sod(n) for n = 100010201102192 and 100010201102201.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37506163 + ... + 40084069.
It is an arithmetic number, because the mean of its divisors is an integer number (3811179187200).
Almost surely, 2100010201102212 is an apocalyptic number.
It is an amenable number.
100010201102212 is a deficient number, since it is larger than the sum of its proper divisors (82926399883388).
100010201102212 is a wasteful number, since it uses less digits than its factorization.
100010201102212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2582800 (or 2582798 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100010201102212 its reverse (212201102010001), we get a palindrome (312211303112213).
The spelling of 100010201102212 in words is "one hundred trillion, ten billion, two hundred one million, one hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •