Base | Representation |
---|---|
bin | 1010000011110011110000… |
… | …10111100000001000001111 |
3 | 2220022202102120012121212122 |
4 | 11001321320113200020033 |
5 | 10344413003324014411 |
6 | 115014143221523155 |
7 | 4442124335035331 |
oct | 501717027401017 |
9 | 86282376177778 |
10 | 22121101001231 |
11 | 7059562901511 |
12 | 2593273b734bb |
13 | c4601ab73a8b |
14 | 56694a373451 |
15 | 2856497eb9db |
hex | 141e785e020f |
22121101001231 has 4 divisors (see below), whose sum is σ = 23285369475000. Its totient is φ = 20956832527464.
The previous prime is 22121101001191. The next prime is 22121101001243. The reversal of 22121101001231 is 13210010112122.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-22121101001231 is a prime.
It is a super-2 number, since 2×221211010012312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22121101000231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 582134236856 + ... + 582134236893.
It is an arithmetic number, because the mean of its divisors is an integer number (5821342368750).
Almost surely, 222121101001231 is an apocalyptic number.
22121101001231 is a deficient number, since it is larger than the sum of its proper divisors (1164268473769).
22121101001231 is a wasteful number, since it uses less digits than its factorization.
22121101001231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1164268473768.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 22121101001231 its reverse (13210010112122), we get a palindrome (35331111113353).
The spelling of 22121101001231 in words is "twenty-two trillion, one hundred twenty-one billion, one hundred one million, one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •