Base | Representation |
---|---|
bin | 1001001000000000010100… |
… | …1010011010101100100010 |
3 | 1022112011021002120211020111 |
4 | 2102000011022122230202 |
5 | 2303340322314022242 |
6 | 33201053440401534 |
7 | 2053604214515026 |
oct | 222000512325442 |
9 | 38464232524214 |
10 | 10033130220322 |
11 | 321903249a9a0 |
12 | 11605a30162aa |
13 | 57a173b999a1 |
14 | 26986b19a386 |
15 | 125eb8784817 |
hex | 9200529ab22 |
10033130220322 has 8 divisors (see below), whose sum is σ = 16417849451472. Its totient is φ = 4560513736500.
The previous prime is 10033130220307. The next prime is 10033130220341. The reversal of 10033130220322 is 22302203133001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 456051373651 = 10033130220322 / (1 + 0 + 0 + 3 + 3 + 1 + 3 + 0 + 2 + 2 + 0 + 3 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 10033130220293 and 10033130220302.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 228025686804 + ... + 228025686847.
It is an arithmetic number, because the mean of its divisors is an integer number (2052231181434).
Almost surely, 210033130220322 is an apocalyptic number.
10033130220322 is a deficient number, since it is larger than the sum of its proper divisors (6384719231150).
10033130220322 is a wasteful number, since it uses less digits than its factorization.
10033130220322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456051373664.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 10033130220322 its reverse (22302203133001), we get a palindrome (32335333353323).
The spelling of 10033130220322 in words is "ten trillion, thirty-three billion, one hundred thirty million, two hundred twenty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •