Base | Representation |
---|---|
bin | 10110101111001100011100… |
… | …100001001101100010010100 |
3 | 111010001221000000110021000102 |
4 | 112233030130201031202110 |
5 | 101101400403204133022 |
6 | 552403243020433232 |
7 | 30030530141244626 |
oct | 2657143441154224 |
9 | 433057000407012 |
10 | 100000202021012 |
11 | 2995493604a597 |
12 | b2708613a8818 |
13 | 43a4c94c5a0c7 |
14 | 1a9a06d99cc16 |
15 | b8637c3c7a92 |
hex | 5af31c84d894 |
100000202021012 has 12 divisors (see below), whose sum is σ = 175000814387700. Its totient is φ = 49999969338816.
The previous prime is 100000202021011. The next prime is 100000202021021. The reversal of 100000202021012 is 210120202000001.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 86095312907536 + 13904889113476 = 9278756^2 + 3728926^2 .
It is a junction number, because it is equal to n+sod(n) for n = 100000202020984 and 100000202021002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000202021011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31199153 + ... + 34254744.
It is an arithmetic number, because the mean of its divisors is an integer number (14583401198975).
Almost surely, 2100000202021012 is an apocalyptic number.
It is an amenable number.
100000202021012 is a deficient number, since it is larger than the sum of its proper divisors (75000612366688).
100000202021012 is a wasteful number, since it uses less digits than its factorization.
100000202021012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65835850 (or 65835848 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 100000202021012 its reverse (210120202000001), we get a palindrome (310120404021013).
The spelling of 100000202021012 in words is "one hundred trillion, two hundred two million, twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •