Base | Representation |
---|---|
bin | 1011101001011011100… |
… | …1000000001100010100 |
3 | 201010111022111021112100 |
4 | 2322112321000030110 |
5 | 11234301101133022 |
6 | 231531421522100 |
7 | 20312444054313 |
oct | 2722671001424 |
9 | 633438437470 |
10 | 200100021012 |
11 | 779532774a1 |
12 | 32945113330 |
13 | 15b3bc6c3c8 |
14 | 99834ba27a |
15 | 53121301ac |
hex | 2e96e40314 |
200100021012 has 36 divisors (see below), whose sum is σ = 519478886836. Its totient is φ = 64897303680.
The previous prime is 200100020977. The next prime is 200100021013. The reversal of 200100021012 is 210120001002.
It can be written as a sum of positive squares in 2 ways, for example, as 184010113296 + 16089907716 = 428964^2 + 126846^2 .
It is a tau number, because it is divible by the number of its divisors (36).
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 = 200100020985 and 200100021003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200100021013) 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, 75111289 + ... + 75113952.
Almost surely, 2200100021012 is an apocalyptic number.
It is an amenable number.
200100021012 is an abundant number, since it is smaller than the sum of its proper divisors (319378865824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200100021012 is a wasteful number, since it uses less digits than its factorization.
200100021012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150225288 (or 150225283 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 200100021012 its reverse (210120001002), we get a palindrome (410220022014).
The spelling of 200100021012 in words is "two hundred billion, one hundred million, twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •