Base | Representation |
---|---|
bin | 1001001011111101100110… |
… | …1010110110100010011001 |
3 | 1022202122202102100121021002 |
4 | 2102333121222312202121 |
5 | 2310444043210032301 |
6 | 33252220201354345 |
7 | 2061532112234324 |
oct | 222773152664231 |
9 | 38678672317232 |
10 | 10101120002201 |
11 | 32449519a6378 |
12 | 11717b87989b5 |
13 | 5836baa00057 |
14 | 26cc7ac177bb |
15 | 127b4766516b |
hex | 92fd9ab6899 |
10101120002201 has 8 divisors (see below), whose sum is σ = 10111826704200. Its totient is φ = 10090418704128.
The previous prime is 10101120002177. The next prime is 10101120002203. The reversal of 10101120002201 is 10220002110101.
It can be written as a sum of positive squares in 4 ways, for example, as 3771165918601 + 6329954083600 = 1941949^2 + 2515940^2 .
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 10101120002201 - 230 = 10100046260377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10101120002203) 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, 2394935 + ... + 5092931.
It is an arithmetic number, because the mean of its divisors is an integer number (1263978338025).
Almost surely, 210101120002201 is an apocalyptic number.
It is an amenable number.
10101120002201 is a deficient number, since it is larger than the sum of its proper divisors (10706701999).
10101120002201 is a wasteful number, since it uses less digits than its factorization.
10101120002201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2701963.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10101120002201 its reverse (10220002110101), we get a palindrome (20321122112302).
The spelling of 10101120002201 in words is "ten trillion, one hundred one billion, one hundred twenty million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •