Base | Representation |
---|---|
bin | 1001001011111010001011… |
… | …0101010111100101011001 |
3 | 1022202120101022020021010102 |
4 | 2102332202311113211121 |
5 | 2310440202200341441 |
6 | 33251545015025145 |
7 | 2061500241400442 |
oct | 222764265274531 |
9 | 38676338207112 |
10 | 10100200012121 |
11 | 324451a66019a |
12 | 11715a066b1b5 |
13 | 5835a222791b |
14 | 26cbd09762c9 |
15 | 127ae19da69b |
hex | 92fa2d57959 |
10100200012121 has 4 divisors (see below), whose sum is σ = 10101809099172. Its totient is φ = 10098590925072.
The previous prime is 10100200012117. The next prime is 10100200012139. The reversal of 10100200012121 is 12121000200101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7314185025625 + 2786014986496 = 2704475^2 + 1669136^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100200012121 - 22 = 10100200012117 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10100200012141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 804534110 + ... + 804546663.
It is an arithmetic number, because the mean of its divisors is an integer number (2525452274793).
Almost surely, 210100200012121 is an apocalyptic number.
It is an amenable number.
10100200012121 is a deficient number, since it is larger than the sum of its proper divisors (1609087051).
10100200012121 is an equidigital number, since it uses as much as digits as its factorization.
10100200012121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1609087050.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10100200012121 its reverse (12121000200101), we get a palindrome (22221200212222).
The spelling of 10100200012121 in words is "ten trillion, one hundred billion, two hundred million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •