Base | Representation |
---|---|
bin | 10110111101111001000000… |
… | …011000110000101011100001 |
3 | 111020122110210000101002212100 |
4 | 112331321000120300223201 |
5 | 101214422212000200001 |
6 | 554455224203321013 |
7 | 30163511651625411 |
oct | 2675710030605341 |
9 | 436573700332770 |
10 | 101010121100001 |
11 | 2a20417403a323 |
12 | b3b4531220169 |
13 | 44492a121c749 |
14 | 1ad2cb7502641 |
15 | ba2789865586 |
hex | 5bde40630ae1 |
101010121100001 has 12 divisors (see below), whose sum is σ = 149846846317012. Its totient is φ = 65520078551136.
The previous prime is 101010121099999. The next prime is 101010121100029. The reversal of 101010121100001 is 100001121010101.
It can be written as a sum of positive squares in 2 ways, for example, as 73056747560976 + 27953373539025 = 8547324^2 + 5287095^2 .
It is not a de Polignac number, because 101010121100001 - 21 = 101010121099999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101010121104001) 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, 151666848166 + ... + 151666848831.
Almost surely, 2101010121100001 is an apocalyptic number.
It is an amenable number.
101010121100001 is a deficient number, since it is larger than the sum of its proper divisors (48836725217011).
101010121100001 is a wasteful number, since it uses less digits than its factorization.
101010121100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 303333697040 (or 303333697037 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101010121100001 its reverse (100001121010101), we get a palindrome (201011242110102).
The spelling of 101010121100001 in words is "one hundred one trillion, ten billion, one hundred twenty-one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •