Base | Representation |
---|---|
bin | 1010011110000000100000… |
… | …11010111011001110000001 |
3 | 10000111210222222211001220001 |
4 | 11033000100122323032001 |
5 | 11004140110322402241 |
6 | 120543501142520001 |
7 | 4564143165006253 |
oct | 517002032731601 |
9 | 100453888731801 |
10 | 23021300200321 |
11 | 7376307887555 |
12 | 26b9822a36001 |
13 | cacb8c996767 |
14 | 598345dadcd3 |
15 | 29dc84575431 |
hex | 14f0106bb381 |
23021300200321 has 8 divisors (see below), whose sum is σ = 23414259225600. Its totient is φ = 22628433425040.
The previous prime is 23021300200277. The next prime is 23021300200337. The reversal of 23021300200321 is 12300200312032.
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 23021300200321 - 29 = 23021300199809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23021300200391) 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 7 ways as a sum of consecutive naturals, for example, 22559041 + ... + 23557438.
It is an arithmetic number, because the mean of its divisors is an integer number (2926782403200).
Almost surely, 223021300200321 is an apocalyptic number.
It is an amenable number.
23021300200321 is a deficient number, since it is larger than the sum of its proper divisors (392959025279).
23021300200321 is an equidigital number, since it uses as much as digits as its factorization.
23021300200321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46124999.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 23021300200321 its reverse (12300200312032), we get a palindrome (35321500512353).
The spelling of 23021300200321 in words is "twenty-three trillion, twenty-one billion, three hundred million, two hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •