Base | Representation |
---|---|
bin | 1010100110110000101000… |
… | …10011111110111010011111 |
3 | 10001120120012012101020100211 |
4 | 11103120110103332322133 |
5 | 11024101440334400111 |
6 | 121333552430033251 |
7 | 4624650141225160 |
oct | 523302423767237 |
9 | 101516165336324 |
10 | 23322013200031 |
11 | 74818a04a2007 |
12 | 2747b67048827 |
13 | 1002344436790 |
14 | 5a8b11ab1767 |
15 | 2a69d4623521 |
hex | 1536144fee9f |
23322013200031 has 32 divisors (see below), whose sum is σ = 30215896381440. Its totient is φ = 17480732373504.
The previous prime is 23322013199941. The next prime is 23322013200037. The reversal of 23322013200031 is 13000231022332.
It is a cyclic number.
It is not a de Polignac number, because 23322013200031 - 221 = 23322011102879 is a prime.
It is a super-2 number, since 2×233220132000312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23322013199975 and 23322013200011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23322013200037) 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, 48141591 + ... + 48623623.
It is an arithmetic number, because the mean of its divisors is an integer number (944246761920).
Almost surely, 223322013200031 is an apocalyptic number.
23322013200031 is a deficient number, since it is larger than the sum of its proper divisors (6893883181409).
23322013200031 is a wasteful number, since it uses less digits than its factorization.
23322013200031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 510055.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 23322013200031 its reverse (13000231022332), we get a palindrome (36322244222363).
The spelling of 23322013200031 in words is "twenty-three trillion, three hundred twenty-two billion, thirteen million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •