Base | Representation |
---|---|
bin | 1010001100101000010101… |
… | …0011011010000111100010 |
3 | 1110200212101121021221021210 |
4 | 2203022011103122013202 |
5 | 2432144340340200002 |
6 | 35502433530130550 |
7 | 2235022213610265 |
oct | 243120523320742 |
9 | 43625347257253 |
10 | 11212101100002 |
11 | 3633030854700 |
12 | 1310b91b80a56 |
13 | 6343b181511a |
14 | 2aa950870cdc |
15 | 1469bc1be96c |
hex | a32854da1e2 |
11212101100002 has 24 divisors (see below), whose sum is σ = 24648090023088. Its totient is φ = 3397606393720.
The previous prime is 11212101100001. The next prime is 11212101100043. The reversal of 11212101100002 is 20000110121211.
It is a super-2 number, since 2×112121011000022 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11212101100001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7721831988 + ... + 7721833439.
It is an arithmetic number, because the mean of its divisors is an integer number (1027003750962).
Almost surely, 211212101100002 is an apocalyptic number.
11212101100002 is an abundant number, since it is smaller than the sum of its proper divisors (13435988923086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11212101100002 is a wasteful number, since it uses less digits than its factorization.
11212101100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15443665454 (or 15443665443 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11212101100002 its reverse (20000110121211), we get a palindrome (31212211221213).
The spelling of 11212101100002 in words is "eleven trillion, two hundred twelve billion, one hundred one million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •