Base | Representation |
---|---|
bin | 1001010111101001111110… |
… | …1001011010100110100110 |
3 | 1100110212021210100100222010 |
4 | 2111322133221122212212 |
5 | 2322242004030310042 |
6 | 33524402243415050 |
7 | 2112203261152323 |
oct | 225723751324646 |
9 | 40425253310863 |
10 | 10302010010022 |
11 | 3312070094625 |
12 | 11a4722384486 |
13 | 599624527773 |
14 | 2788971b3b4a |
15 | 12cea3ce059c |
hex | 95e9fa5a9a6 |
10302010010022 has 8 divisors (see below), whose sum is σ = 20604020020056. Its totient is φ = 3434003336672.
The previous prime is 10302010009987. The next prime is 10302010010023. The reversal of 10302010010022 is 22001001020301.
It is a sphenic number, since it is the product of 3 distinct primes.
10302010010022 is an admirable number.
It is a super-2 number, since 2×103020100100222 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10302010010023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 858500834163 + ... + 858500834174.
It is an arithmetic number, because the mean of its divisors is an integer number (2575502502507).
Almost surely, 210302010010022 is an apocalyptic number.
10302010010022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10302010010022 is a wasteful number, since it uses less digits than its factorization.
10302010010022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1717001668342.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10302010010022 its reverse (22001001020301), we get a palindrome (32303011030323).
The spelling of 10302010010022 in words is "ten trillion, three hundred two billion, ten million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •