Base | Representation |
---|---|
bin | 1010000011110001101110… |
… | …10110000010110111110100 |
3 | 2220022122121112111010000012 |
4 | 11001320313112002313310 |
5 | 10344403240041201322 |
6 | 115013443052035352 |
7 | 4442055320400023 |
oct | 501706726026764 |
9 | 86278545433005 |
10 | 22120010100212 |
11 | 7059053041422 |
12 | 259300a762b58 |
13 | c45ba5b5a80b |
14 | 5668855228ba |
15 | 2855d3b61ae2 |
hex | 141e37582df4 |
22120010100212 has 6 divisors (see below), whose sum is σ = 38710017675378. Its totient is φ = 11060005050104.
The previous prime is 22120010100191. The next prime is 22120010100239. The reversal of 22120010100212 is 21200101002122.
It can be written as a sum of positive squares in only one way, i.e., 22108465457296 + 11544642916 = 4701964^2 + 107446^2 .
It is a congruent number.
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 as a sum of consecutive naturals, namely, 2765001262523 + ... + 2765001262530.
It is an arithmetic number, because the mean of its divisors is an integer number (6451669612563).
Almost surely, 222120010100212 is an apocalyptic number.
It is an amenable number.
22120010100212 is a deficient number, since it is larger than the sum of its proper divisors (16590007575166).
22120010100212 is a wasteful number, since it uses less digits than its factorization.
22120010100212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5530002525057 (or 5530002525055 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 22120010100212 its reverse (21200101002122), we get a palindrome (43320111102334).
It can be divided in two parts, 2 and 2120010100212, that multiplied together give a palindrome (4240020200424).
The spelling of 22120010100212 in words is "twenty-two trillion, one hundred twenty billion, ten million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •