Base | Representation |
---|---|
bin | 10110101111001100010111… |
… | …101100111010011000011001 |
3 | 111010001220210101101020110010 |
4 | 112233030113230322120121 |
5 | 101101400222011432301 |
6 | 552403231012312133 |
7 | 30030525140301363 |
oct | 2657142754723031 |
9 | 433056711336403 |
10 | 100000121202201 |
11 | 299548a446a190 |
12 | b27083a312649 |
13 | 43a4c812a111c |
14 | 1a9a062d61d33 |
15 | b863752615d6 |
hex | 5af317b3a619 |
100000121202201 has 64 divisors (see below), whose sum is σ = 146211574265856. Its totient is φ = 60291497011200.
The previous prime is 100000121202151. The next prime is 100000121202259. The reversal of 100000121202201 is 102202121000001.
It is not a de Polignac number, because 100000121202201 - 210 = 100000121201177 is a prime.
It is a super-3 number, since 3×1000001212022013 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (100000121202001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 28843413670 + ... + 28843417136.
It is an arithmetic number, because the mean of its divisors is an integer number (2284555847904).
Almost surely, 2100000121202201 is an apocalyptic number.
100000121202201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100000121202201 is a deficient number, since it is larger than the sum of its proper divisors (46211453063655).
100000121202201 is a wasteful number, since it uses less digits than its factorization.
100000121202201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7422.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100000121202201 its reverse (102202121000001), we get a palindrome (202202242202202).
The spelling of 100000121202201 in words is "one hundred trillion, one hundred twenty-one million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •