Base | Representation |
---|---|
bin | 11101011101000000000… |
… | …01101001001110001110 |
3 | 10120202011011111021122100 |
4 | 32232200001221032032 |
5 | 113040040014200420 |
6 | 2052523553055530 |
7 | 133054232630361 |
oct | 16564001511616 |
9 | 3522134437570 |
10 | 1012002100110 |
11 | 3602078913a1 |
12 | 1441715575a6 |
13 | 7457b9b7221 |
14 | 36da44500d8 |
15 | 1b4d029e190 |
hex | eba006938e |
1012002100110 has 96 divisors (see below), whose sum is σ = 2638056234528. Its totient is φ = 269165445120.
The previous prime is 1012002100103. The next prime is 1012002100183. The reversal of 1012002100110 is 110012002101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1012002100092 and 1012002100101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 62488174 + ... + 62504366.
It is an arithmetic number, because the mean of its divisors is an integer number (27479752443).
Almost surely, 21012002100110 is an apocalyptic number.
1012002100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1012002100110 is an abundant number, since it is smaller than the sum of its proper divisors (1626054134418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012002100110 is a wasteful number, since it uses less digits than its factorization.
1012002100110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17970 (or 17967 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1012002100110 its reverse (110012002101), we get a palindrome (1122014102211).
The spelling of 1012002100110 in words is "one trillion, twelve billion, two million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •