Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …01100010100100010100 |
3 | 10112121110110201001000210 |
4 | 32203123101202210110 |
5 | 112341211433033022 |
6 | 2043240022205420 |
7 | 132153455054361 |
oct | 16433321424424 |
9 | 3477413631023 |
10 | 1000111221012 |
11 | 356165790992 |
12 | 1419b3283870 |
13 | 7340533a8a7 |
14 | 36597119468 |
15 | 1b0363d5a0c |
hex | e8db462914 |
1000111221012 has 24 divisors (see below), whose sum is σ = 2414061568800. Its totient is φ = 321874875616.
The previous prime is 1000111221001. The next prime is 1000111221029. The reversal of 1000111221012 is 2101221110001.
It is a super-2 number, since 2×10001112210122 (a number of 25 digits) contains 22 as substring.
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 polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1436941062 + ... + 1436941757.
It is an arithmetic number, because the mean of its divisors is an integer number (100585898700).
Almost surely, 21000111221012 is an apocalyptic number.
1000111221012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1000111221012 is an abundant number, since it is smaller than the sum of its proper divisors (1413950347788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000111221012 is a wasteful number, since it uses less digits than its factorization.
1000111221012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2873882855 (or 2873882853 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1000111221012 its reverse (2101221110001), we get a palindrome (3101332331013).
The spelling of 1000111221012 in words is "one trillion, one hundred eleven million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •