Base | Representation |
---|---|
bin | 1001010010000101111101… |
… | …0000010111001100010001 |
3 | 1100010201121101022011211001 |
4 | 2110201133100113030101 |
5 | 2314210242221420423 |
6 | 33412435103422001 |
7 | 2102251052066320 |
oct | 224413720271421 |
9 | 40121541264731 |
10 | 10206440420113 |
11 | 3285588599173 |
12 | 118a0b02b4901 |
13 | 590603867872 |
14 | 273dcc7060b7 |
15 | 12a75d9e9cad |
hex | 9485f417311 |
10206440420113 has 8 divisors (see below), whose sum is σ = 11741751704960. Its totient is φ = 8690441227200.
The previous prime is 10206440420053. The next prime is 10206440420129. The reversal of 10206440420113 is 31102404460201.
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 10206440420113 - 217 = 10206440289041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10206440420153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4828021848 + ... + 4828023961.
It is an arithmetic number, because the mean of its divisors is an integer number (1467718963120).
Almost surely, 210206440420113 is an apocalyptic number.
It is an amenable number.
10206440420113 is a deficient number, since it is larger than the sum of its proper divisors (1535311284847).
10206440420113 is an equidigital number, since it uses as much as digits as its factorization.
10206440420113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9656045967.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 10206440420113 its reverse (31102404460201), we get a palindrome (41308844880314).
The spelling of 10206440420113 in words is "ten trillion, two hundred six billion, four hundred forty million, four hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •