Base | Representation |
---|---|
bin | 1001010001110010100101… |
… | …1010101111010010101110 |
3 | 1100010020012002221101220210 |
4 | 2110130221122233102232 |
5 | 2314114121001001220 |
6 | 33410215211523250 |
7 | 2102005202012304 |
oct | 224345132572256 |
9 | 40106162841823 |
10 | 10201242203310 |
11 | 3283360306a24 |
12 | 118909b459526 |
13 | 58cc85927532 |
14 | 273a581a8274 |
15 | 12a55748c6e0 |
hex | 947296af4ae |
10201242203310 has 32 divisors (see below), whose sum is σ = 24777956972160. Its totient is φ = 2687556178208.
The previous prime is 10201242203303. The next prime is 10201242203329. The reversal of 10201242203310 is 1330224210201.
It is a super-2 number, since 2×102012422033102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2048439720 + ... + 2048444699.
It is an arithmetic number, because the mean of its divisors is an integer number (774311155380).
Almost surely, 210201242203310 is an apocalyptic number.
10201242203310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10201242203310 is an abundant number, since it is smaller than the sum of its proper divisors (14576714768850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201242203310 is a wasteful number, since it uses less digits than its factorization.
10201242203310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4096884512.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10201242203310 its reverse (1330224210201), we get a palindrome (11531466413511).
The spelling of 10201242203310 in words is "ten trillion, two hundred one billion, two hundred forty-two million, two hundred three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •