Base | Representation |
---|---|
bin | 1001010001110110010110… |
… | …0110110101010000100001 |
3 | 1100010022210111001201101110 |
4 | 2110131211212311100201 |
5 | 2314123203003201213 |
6 | 33410503323253533 |
7 | 2102042213132604 |
oct | 224354546652041 |
9 | 40108714051343 |
10 | 10202252006433 |
11 | 3283829315a63 |
12 | 118932167a2a9 |
13 | 5900b6bb7786 |
14 | 273b1234833b |
15 | 12a5b5e585c3 |
hex | 947659b5421 |
10202252006433 has 8 divisors (see below), whose sum is σ = 13604220208768. Its totient is φ = 6800892570864.
The previous prime is 10202252006417. The next prime is 10202252006477. The reversal of 10202252006433 is 33460025220201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10202252006433 - 24 = 10202252006417 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10202252006433.
It is not an unprimeable number, because it can be changed into a prime (10202252006033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 152152585 + ... + 152219622.
It is an arithmetic number, because the mean of its divisors is an integer number (1700527526096).
Almost surely, 210202252006433 is an apocalyptic number.
It is an amenable number.
10202252006433 is a deficient number, since it is larger than the sum of its proper divisors (3401968202335).
10202252006433 is a wasteful number, since it uses less digits than its factorization.
10202252006433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304383383.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 10202252006433 its reverse (33460025220201), we get a palindrome (43662277226634).
The spelling of 10202252006433 in words is "ten trillion, two hundred two billion, two hundred fifty-two million, six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •