Base | Representation |
---|---|
bin | 10000010100001001001… |
… | …111000010011001111100 |
3 | 10222011212021100020002110 |
4 | 100110021033002121330 |
5 | 121332044144314322 |
6 | 2215013435054020 |
7 | 143666633446530 |
oct | 20241117023174 |
9 | 3864767306073 |
10 | 1121141401212 |
11 | 3a25231026a8 |
12 | 16134bba1310 |
13 | 81952a9b131 |
14 | 3c3991c7bc0 |
15 | 1e26ba2ec0c |
hex | 105093c267c |
1121141401212 has 96 divisors (see below), whose sum is σ = 3101662412800. Its totient is φ = 308435117760.
The previous prime is 1121141401189. The next prime is 1121141401277. The reversal of 1121141401212 is 2121041411211.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 563578 + ... + 1599969.
Almost surely, 21121141401212 is an apocalyptic number.
1121141401212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1121141401212 is an abundant number, since it is smaller than the sum of its proper divisors (1980521011588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121141401212 is a wasteful number, since it uses less digits than its factorization.
1121141401212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2163791 (or 2163789 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 1121141401212 its reverse (2121041411211), we get a palindrome (3242182812423).
Subtracting 1121141401212 from its reverse (2121041411211), we obtain a palindrome (999900009999).
The spelling of 1121141401212 in words is "one trillion, one hundred twenty-one billion, one hundred forty-one million, four hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •