Base | Representation |
---|---|
bin | 11101011100111111110… |
… | …10011100000001000010 |
3 | 10120202011000221022021200 |
4 | 32232133322130001002 |
5 | 113040034023223020 |
6 | 2052523444402030 |
7 | 133054210601655 |
oct | 16563772340102 |
9 | 3522130838250 |
10 | 1012000211010 |
11 | 360206811058 |
12 | 1441709a6316 |
13 | 7457b4a5409 |
14 | 36da40bb89c |
15 | 1b4d0029590 |
hex | eb9fe9c042 |
1012000211010 has 48 divisors (see below), whose sum is σ = 2633251667904. Its totient is φ = 269656351776.
The previous prime is 1012000210999. The next prime is 1012000211039. The reversal of 1012000211010 is 101120002101.
It is a happy number.
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 = 1012000210983 and 1012000211001.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4266622 + ... + 4497561.
It is an arithmetic number, because the mean of its divisors is an integer number (54859409748).
Almost surely, 21012000211010 is an apocalyptic number.
1012000211010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1012000211010 is an abundant number, since it is smaller than the sum of its proper divisors (1621251456894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012000211010 is a wasteful number, since it uses less digits than its factorization.
1012000211010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8765479 (or 8765476 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1012000211010 its reverse (101120002101), we get a palindrome (1113120213111).
The spelling of 1012000211010 in words is "one trillion, twelve billion, two hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •