Base | Representation |
---|---|
bin | 1011101001011100000… |
… | …0100011100101110100 |
3 | 201010111110012212120200 |
4 | 2322113000203211310 |
5 | 11234302103013022 |
6 | 231531532200500 |
7 | 20312466642024 |
oct | 2722700434564 |
9 | 633443185520 |
10 | 200102001012 |
11 | 779543aa061 |
12 | 32945909130 |
13 | 15b3c4b36c4 |
14 | 9983873a84 |
15 | 53123c1bac |
hex | 2e97023974 |
200102001012 has 18 divisors (see below), whose sum is σ = 505813391538. Its totient is φ = 66700666992.
The previous prime is 200102000953. The next prime is 200102001017. The reversal of 200102001012 is 210100201002.
It can be written as a sum of positive squares in only one way, i.e., 185170138596 + 14931862416 = 430314^2 + 122196^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 200102000985 and 200102001003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200102001017) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2779194423 + ... + 2779194494.
Almost surely, 2200102001012 is an apocalyptic number.
It is an amenable number.
200102001012 is an abundant number, since it is smaller than the sum of its proper divisors (305711390526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200102001012 is a wasteful number, since it uses less digits than its factorization.
200102001012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5558388927 (or 5558388922 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 200102001012 its reverse (210100201002), we get a palindrome (410202202014).
The spelling of 200102001012 in words is "two hundred billion, one hundred two million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •