Base | Representation |
---|---|
bin | 1001000111011000000011… |
… | …1101000110011001110111 |
3 | 1022111010100212101121200011 |
4 | 2101312000331012121313 |
5 | 2303201203440432411 |
6 | 33152105151201051 |
7 | 2053042326053143 |
oct | 221660075063167 |
9 | 38433325347604 |
10 | 10022322202231 |
11 | 3214496668a39 |
12 | 115a487516187 |
13 | 57914097cc01 |
14 | 2691239c2223 |
15 | 125a849b8c21 |
hex | 91d80f46677 |
10022322202231 has 32 divisors (see below), whose sum is σ = 10784765730816. Its totient is φ = 9296507808000.
The previous prime is 10022322202223. The next prime is 10022322202261. The reversal of 10022322202231 is 13220222322001.
10022322202231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10022322202231 - 23 = 10022322202223 is a prime.
It is a super-2 number, since 2×100223222022312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10022322202261) 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, 34902915 + ... + 35188891.
It is an arithmetic number, because the mean of its divisors is an integer number (337023929088).
Almost surely, 210022322202231 is an apocalyptic number.
10022322202231 is a deficient number, since it is larger than the sum of its proper divisors (762443528585).
10022322202231 is a wasteful number, since it uses less digits than its factorization.
10022322202231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 286543.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 10022322202231 its reverse (13220222322001), we get a palindrome (23242544524232).
The spelling of 10022322202231 in words is "ten trillion, twenty-two billion, three hundred twenty-two million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •