Base | Representation |
---|---|
bin | 1001010010111001010100… |
… | …1100001101011101011101 |
3 | 1100012001012102012202001001 |
4 | 2110232111030031131131 |
5 | 2314422012413000404 |
6 | 33423035310350301 |
7 | 2103246555235534 |
oct | 224562514153535 |
9 | 40161172182031 |
10 | 10220230203229 |
11 | 3290414566342 |
12 | 11908ba4bb391 |
13 | 5919c0752c47 |
14 | 274939cdb31b |
15 | 12acb94567a4 |
hex | 94b9530d75d |
10220230203229 has 8 divisors (see below), whose sum is σ = 10664621121600. Its totient is φ = 9775842041856.
The previous prime is 10220230203193. The next prime is 10220230203317. The reversal of 10220230203229 is 92230203202201.
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 10220230203229 - 27 = 10220230203101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10220230203197 and 10220230203206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220230003229) 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, 11390914 + ... + 12255340.
It is an arithmetic number, because the mean of its divisors is an integer number (1333077640200).
Almost surely, 210220230203229 is an apocalyptic number.
It is an amenable number.
10220230203229 is a deficient number, since it is larger than the sum of its proper divisors (444390918371).
10220230203229 is an equidigital number, since it uses as much as digits as its factorization.
10220230203229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1378499.
The product of its (nonzero) digits is 5184, while the sum is 28.
The spelling of 10220230203229 in words is "ten trillion, two hundred twenty billion, two hundred thirty million, two hundred three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •