Base | Representation |
---|---|
bin | 1010011110000010011010… |
… | …10101100011100101111001 |
3 | 10000111220122012220012000011 |
4 | 11033001031111203211321 |
5 | 11004144203440444001 |
6 | 120544150411541521 |
7 | 4564210414620022 |
oct | 517011525434571 |
9 | 100456565805004 |
10 | 23022322203001 |
11 | 7376791769270 |
12 | 26b9a6915a8a1 |
13 | caccc3638784 |
14 | 598401a07c49 |
15 | 29dce4150d51 |
hex | 14f04d563979 |
23022322203001 has 8 divisors (see below), whose sum is σ = 26437116405600. Its totient is φ = 19827837303840.
The previous prime is 23022322202989. The next prime is 23022322203007. The reversal of 23022322203001 is 10030222322032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23022322203001 - 211 = 23022322200953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23022322203007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55077325636 + ... + 55077326053.
It is an arithmetic number, because the mean of its divisors is an integer number (3304639550700).
Almost surely, 223022322203001 is an apocalyptic number.
It is an amenable number.
23022322203001 is a deficient number, since it is larger than the sum of its proper divisors (3414794202599).
23022322203001 is a wasteful number, since it uses less digits than its factorization.
23022322203001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110154651719.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 23022322203001 its reverse (10030222322032), we get a palindrome (33052544525033).
The spelling of 23022322203001 in words is "twenty-three trillion, twenty-two billion, three hundred twenty-two million, two hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •