Base | Representation |
---|---|
bin | 10110101111010101110000… |
… | …100001000101110100001001 |
3 | 111010002212210212200200210210 |
4 | 112233111300201011310021 |
5 | 101102031343002210441 |
6 | 552412015134031333 |
7 | 30031333006041516 |
oct | 2657256041056411 |
9 | 433085725620723 |
10 | 100010201210121 |
11 | 299590a7360344 |
12 | b272792048549 |
13 | 43a5bc9722457 |
14 | 1a9a73b99030d |
15 | b86765175616 |
hex | 5af570845d09 |
100010201210121 has 8 divisors (see below), whose sum is σ = 133772963494240. Its totient is φ = 66460453199712.
The previous prime is 100010201210093. The next prime is 100010201210123. The reversal of 100010201210121 is 121012102010001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100010201210121 - 29 = 100010201209609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100010201210097 and 100010201210106.
It is not an unprimeable number, because it can be changed into a prime (100010201210123) 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, 53253567331 + ... + 53253569208.
It is an arithmetic number, because the mean of its divisors is an integer number (16721620436780).
Almost surely, 2100010201210121 is an apocalyptic number.
It is an amenable number.
100010201210121 is a deficient number, since it is larger than the sum of its proper divisors (33762762284119).
100010201210121 is a wasteful number, since it uses less digits than its factorization.
100010201210121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106507136855.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100010201210121 its reverse (121012102010001), we get a palindrome (221022303220122).
The spelling of 100010201210121 in words is "one hundred trillion, ten billion, two hundred one million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •