Base | Representation |
---|---|
bin | 1001010010010111010011… |
… | …1111010010011010001001 |
3 | 1100011011122010010212122202 |
4 | 2110211310333102122021 |
5 | 2314244313100310441 |
6 | 33414525314525545 |
7 | 2102504402000663 |
oct | 224456477223211 |
9 | 40134563125582 |
10 | 10211100010121 |
11 | 32875598310aa |
12 | 118ab908968b5 |
13 | 590b9701a30a |
14 | 2743114b5533 |
15 | 12a932b0e19b |
hex | 94974fd2689 |
10211100010121 has 8 divisors (see below), whose sum is σ = 10363597125984. Its totient is φ = 10058605619040.
The previous prime is 10211100010049. The next prime is 10211100010127. The reversal of 10211100010121 is 12101000111201.
10211100010121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10211100010121 - 218 = 10211099747977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10211100010127) 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, 7619381 + ... + 8858733.
It is an arithmetic number, because the mean of its divisors is an integer number (1295449640748).
Almost surely, 210211100010121 is an apocalyptic number.
It is an amenable number.
10211100010121 is a deficient number, since it is larger than the sum of its proper divisors (152497115863).
10211100010121 is a wasteful number, since it uses less digits than its factorization.
10211100010121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1362391.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10211100010121 its reverse (12101000111201), we get a palindrome (22312100121322).
The spelling of 10211100010121 in words is "ten trillion, two hundred eleven billion, one hundred million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •