Base | Representation |
---|---|
bin | 10001100111110110111… |
… | …110001010011101111000 |
3 | 11021202212201021122210020 |
4 | 101213312332022131320 |
5 | 124320142000113422 |
6 | 2324201132450440 |
7 | 153331302133611 |
oct | 21476676123570 |
9 | 4252781248706 |
10 | 1211029301112 |
11 | 42765a518284 |
12 | 176857319a20 |
13 | 8a279601197 |
14 | 42885264c08 |
15 | 2177d11695c |
hex | 119f6f8a778 |
1211029301112 has 16 divisors (see below), whose sum is σ = 3027573252840. Its totient is φ = 403676433696.
The previous prime is 1211029301089. The next prime is 1211029301129. The reversal of 1211029301112 is 2111039201121.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 50459554213 = 1211029301112 / (1 + 2 + 1 + 1 + 0 + 2 + 9 + 3 + 0 + 1 + 1 + 1 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25229777083 + ... + 25229777130.
Almost surely, 21211029301112 is an apocalyptic number.
1211029301112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1211029301112 is an abundant number, since it is smaller than the sum of its proper divisors (1816543951728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211029301112 is a wasteful number, since it uses less digits than its factorization.
1211029301112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50459554222 (or 50459554218 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 24.
Subtracting 1211029301112 from its reverse (2111039201121), we obtain a palindrome (900009900009).
The spelling of 1211029301112 in words is "one trillion, two hundred eleven billion, twenty-nine million, three hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •