Base | Representation |
---|---|
bin | 1001000110001101000110… |
… | …1101011010111100110101 |
3 | 1022102012102200002010011110 |
4 | 2101203101231122330311 |
5 | 2302334002231210401 |
6 | 33134540454025233 |
7 | 2051430616000023 |
oct | 221432155327465 |
9 | 38365380063143 |
10 | 10002202210101 |
11 | 3206a01433072 |
12 | 11565b1348219 |
13 | 577285481b1a |
14 | 2681757c3713 |
15 | 1252a84499d6 |
hex | 918d1b5af35 |
10002202210101 has 8 divisors (see below), whose sum is σ = 13587897342240. Its totient is φ = 6542320942352.
The previous prime is 10002202210087. The next prime is 10002202210127. The reversal of 10002202210101 is 10101220220001.
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 10002202210101 - 25 = 10002202210069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002202210141) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 31453465911 + ... + 31453466228.
It is an arithmetic number, because the mean of its divisors is an integer number (1698487167780).
Almost surely, 210002202210101 is an apocalyptic number.
It is an amenable number.
10002202210101 is a deficient number, since it is larger than the sum of its proper divisors (3585695132139).
10002202210101 is an equidigital number, since it uses as much as digits as its factorization.
10002202210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62906932195.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10002202210101 its reverse (10101220220001), we get a palindrome (20103422430102).
The spelling of 10002202210101 in words is "ten trillion, two billion, two hundred two million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •