Base | Representation |
---|---|
bin | 1001010010111000111010… |
… | …1000010001101110001011 |
3 | 1100012000220202001221111221 |
4 | 2110232032220101232023 |
5 | 2314421301222321303 |
6 | 33423020335102511 |
7 | 2103244050450010 |
oct | 224561650215613 |
9 | 40160822057457 |
10 | 10220120120203 |
11 | 3290368408334 |
12 | 1190889671a37 |
13 | 5919a39bbb66 |
14 | 274929443707 |
15 | 12acae95e4bd |
hex | 94b8ea11b8b |
10220120120203 has 8 divisors (see below), whose sum is σ = 11717693994240. Its totient is φ = 8731935424680.
The previous prime is 10220120120201. The next prime is 10220120120207. The reversal of 10220120120203 is 30202102102201.
It is a happy number.
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 10220120120203 - 21 = 10220120120201 is a prime.
It is a super-2 number, since 2×102201201202032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10220120120201) 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, 2347292293 + ... + 2347296646.
It is an arithmetic number, because the mean of its divisors is an integer number (1464711749280).
Almost surely, 210220120120203 is an apocalyptic number.
10220120120203 is a deficient number, since it is larger than the sum of its proper divisors (1497573874037).
10220120120203 is an equidigital number, since it uses as much as digits as its factorization.
10220120120203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4694589257.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 10220120120203 its reverse (30202102102201), we get a palindrome (40422222222404).
The spelling of 10220120120203 in words is "ten trillion, two hundred twenty billion, one hundred twenty million, one hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •