Base | Representation |
---|---|
bin | 11101011001101001001… |
… | …11101000101110010100 |
3 | 10120120111120202012221010 |
4 | 32230310213220232110 |
5 | 113022342212321322 |
6 | 2052025102252220 |
7 | 132661462225563 |
oct | 16546447505624 |
9 | 3516446665833 |
10 | 1010200120212 |
11 | 35a4726a5208 |
12 | 143949b87070 |
13 | 74352582c2a |
14 | 36c72dbdbda |
15 | 1b426ea420c |
hex | eb349e8b94 |
1010200120212 has 24 divisors (see below), whose sum is σ = 2433170182912. Its totient is φ = 325871006400.
The previous prime is 1010200120207. The next prime is 1010200120217. The reversal of 1010200120212 is 2120210020101.
It is an interprime number because it is at equal distance from previous prime (1010200120207) and next prime (1010200120217).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010200120217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1357795489 + ... + 1357796232.
Almost surely, 21010200120212 is an apocalyptic number.
1010200120212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1010200120212 is an abundant number, since it is smaller than the sum of its proper divisors (1422970062700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010200120212 is a wasteful number, since it uses less digits than its factorization.
1010200120212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2715591759 (or 2715591757 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1010200120212 its reverse (2120210020101), we get a palindrome (3130410140313).
The spelling of 1010200120212 in words is "one trillion, ten billion, two hundred million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •