Base | Representation |
---|---|
bin | 10110111101110001100011… |
… | …100011100110110011110001 |
3 | 111020121201010111011122101121 |
4 | 112331301203203212303301 |
5 | 101214304321012223441 |
6 | 554451422310102241 |
7 | 30163106501660254 |
oct | 2675614343466361 |
9 | 436551114148347 |
10 | 101002121211121 |
11 | 2a200839338409 |
12 | b3b2a7a04a981 |
13 | 44485c7a180a0 |
14 | 1ad2758c6709b |
15 | ba246c38cdd1 |
hex | 5bdc638e6cf1 |
101002121211121 has 12 divisors (see below), whose sum is σ = 115546211600092. Its totient is φ = 87748449193728.
The previous prime is 101002121211113. The next prime is 101002121211161. The reversal of 101002121211121 is 121112121200101.
It can be written as a sum of positive squares in 6 ways, for example, as 1148787394225 + 99853333816896 = 1071815^2 + 9992664^2 .
It is not a de Polignac number, because 101002121211121 - 23 = 101002121211113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101002121211095 and 101002121211104.
It is not an unprimeable number, because it can be changed into a prime (101002121211161) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13441854270 + ... + 13441861783.
Almost surely, 2101002121211121 is an apocalyptic number.
It is an amenable number.
101002121211121 is a deficient number, since it is larger than the sum of its proper divisors (14544090388971).
101002121211121 is a wasteful number, since it uses less digits than its factorization.
101002121211121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26883716100 (or 26883716083 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 101002121211121 its reverse (121112121200101), we get a palindrome (222114242411222).
The spelling of 101002121211121 in words is "one hundred one trillion, two billion, one hundred twenty-one million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •