Base | Representation |
---|---|
bin | 1001000110000101010100… |
… | …1000101101000111110101 |
3 | 1022102000001000101010120220 |
4 | 2101201111020231013311 |
5 | 2302320212211213141 |
6 | 33133553234044553 |
7 | 2051325050203344 |
oct | 221412510550765 |
9 | 38360030333526 |
10 | 10000112210421 |
11 | 3206029705403 |
12 | 1156109419759 |
13 | 577011485a18 |
14 | 268017dbbb5b |
15 | 1251d4c0a766 |
hex | 9185522d1f5 |
10000112210421 has 32 divisors (see below), whose sum is σ = 13577188294656. Its totient is φ = 6545677824000.
The previous prime is 10000112210299. The next prime is 10000112210449. The reversal of 10000112210421 is 12401221100001.
It is not a de Polignac number, because 10000112210421 - 29 = 10000112209909 is a prime.
It is a super-2 number, since 2×100001122104212 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10000112210421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000112210471) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 251296036 + ... + 251335826.
It is an arithmetic number, because the mean of its divisors is an integer number (424287134208).
Almost surely, 210000112210421 is an apocalyptic number.
It is an amenable number.
10000112210421 is a deficient number, since it is larger than the sum of its proper divisors (3577076084235).
10000112210421 is a wasteful number, since it uses less digits than its factorization.
10000112210421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44713.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10000112210421 its reverse (12401221100001), we get a palindrome (22401333310422).
The spelling of 10000112210421 in words is "ten trillion, one hundred twelve million, two hundred ten thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •