Base | Representation |
---|---|
bin | 1001001100000001101011… |
… | …1000111011111001010001 |
3 | 1022202202120200022021120102 |
4 | 2103000122320323321101 |
5 | 2311003313314310301 |
6 | 33252520530222145 |
7 | 2061601200000005 |
oct | 223003270737121 |
9 | 38682520267512 |
10 | 10102214213201 |
11 | 3245363617290 |
12 | 1171a63124955 |
13 | 583833604a96 |
14 | 26cd4228a705 |
15 | 127bad755b6b |
hex | 9301ae3be51 |
10102214213201 has 8 divisors (see below), whose sum is σ = 11318451305664. Its totient is φ = 8935619451120.
The previous prime is 10102214213171. The next prime is 10102214213219. The reversal of 10102214213201 is 10231241220101.
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 10102214213201 - 218 = 10102213951057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10102214213101) 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, 12410582165 + ... + 12410582978.
It is an arithmetic number, because the mean of its divisors is an integer number (1414806413208).
Almost surely, 210102214213201 is an apocalyptic number.
10102214213201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10102214213201 is a deficient number, since it is larger than the sum of its proper divisors (1216237092463).
10102214213201 is a wasteful number, since it uses less digits than its factorization.
10102214213201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24821165191.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 10102214213201 its reverse (10231241220101), we get a palindrome (20333455433302).
The spelling of 10102214213201 in words is "ten trillion, one hundred two billion, two hundred fourteen million, two hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •