Base | Representation |
---|---|
bin | 101110100100100101… |
… | …1111000101000011001 |
3 | 100120011000102002111100 |
4 | 1131021023320220121 |
5 | 3114311044200441 |
6 | 113540034222013 |
7 | 10140251552553 |
oct | 1351113705031 |
9 | 316130362440 |
10 | 100012100121 |
11 | 394622500aa |
12 | 17471a24909 |
13 | 957b18818b |
14 | 4baa8d04d3 |
15 | 2905329cb6 |
hex | 17492f8a19 |
100012100121 has 48 divisors (see below), whose sum is σ = 160058240784. Its totient is φ = 59904479232.
The previous prime is 100012100093. The next prime is 100012100143. The reversal of 100012100121 is 121001210001.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 16418834496 + 83593265625 = 128136^2 + 289125^2 .
It is not a de Polignac number, because 100012100121 - 26 = 100012100057 is a prime.
It is a super-2 number, since 2×1000121001212 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (100012100821) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 133365 + ... + 466701.
It is an arithmetic number, because the mean of its divisors is an integer number (3334546683).
Almost surely, 2100012100121 is an apocalyptic number.
It is an amenable number.
100012100121 is a deficient number, since it is larger than the sum of its proper divisors (60046140663).
100012100121 is a wasteful number, since it uses less digits than its factorization.
100012100121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 333450 (or 333447 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100012100121 its reverse (121001210001), we get a palindrome (221013310122).
The spelling of 100012100121 in words is "one hundred billion, twelve million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •