Base | Representation |
---|---|
bin | 11101000110110110011… |
… | …01010011110111010100 |
3 | 10112121110101121201001010 |
4 | 32203123031103313110 |
5 | 112341211142042322 |
6 | 2043235542332220 |
7 | 132153442455621 |
oct | 16433315236724 |
9 | 3477411551033 |
10 | 1000110112212 |
11 | 3561650a3922 |
12 | 1419b2a2a070 |
13 | 7340503ccb3 |
14 | 36596d0b348 |
15 | 1b03626720c |
hex | e8db353dd4 |
1000110112212 has 24 divisors (see below), whose sum is σ = 2334278528512. Its totient is φ = 333271713600.
The previous prime is 1000110112193. The next prime is 1000110112231. The reversal of 1000110112212 is 2122110110001.
It is an interprime number because it is at equal distance from previous prime (1000110112193) and next prime (1000110112231).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12248089 + ... + 12329472.
Almost surely, 21000110112212 is an apocalyptic number.
1000110112212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1000110112212 is an abundant number, since it is smaller than the sum of its proper divisors (1334168416300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000110112212 is a wasteful number, since it uses less digits than its factorization.
1000110112212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24580959 (or 24580957 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1000110112212 its reverse (2122110110001), we get a palindrome (3122220222213).
The spelling of 1000110112212 in words is "one trillion, one hundred ten million, one hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •