Base | Representation |
---|---|
bin | 100001000111010… |
… | …0101110001110100 |
3 | 2212102202210111002 |
4 | 1002032211301310 |
5 | 4233421333022 |
6 | 302131102432 |
7 | 36351241601 |
oct | 10216456164 |
9 | 2772683432 |
10 | 1111121012 |
11 | 520220731 |
12 | 270141a18 |
13 | 149275871 |
14 | a77d56a8 |
15 | 67831092 |
hex | 423a5c74 |
1111121012 has 12 divisors (see below), whose sum is σ = 1957512900. Its totient is φ = 551831616.
The previous prime is 1111120957. The next prime is 1111121021. The reversal of 1111121012 is 2101211111.
It can be written as a sum of positive squares in 2 ways, for example, as 244171876 + 866949136 = 15626^2 + 29444^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1111120984 and 1111121002.
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, 931553 + ... + 932744.
It is an arithmetic number, because the mean of its divisors is an integer number (163126075).
Almost surely, 21111121012 is an apocalyptic number.
It is an amenable number.
1111121012 is a deficient number, since it is larger than the sum of its proper divisors (846391888).
1111121012 is a wasteful number, since it uses less digits than its factorization.
1111121012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1864450 (or 1864448 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
The square root of 1111121012 is about 33333.4818463358. The cubic root of 1111121012 is about 1035.7472450785.
Adding to 1111121012 its reverse (2101211111), we get a palindrome (3212332123).
Subtracting 1111121012 from its reverse (2101211111), we obtain a palindrome (990090099).
It can be divided in two parts, 11111 and 21012, that multiplied together give a palindrome (233464332).
The spelling of 1111121012 in words is "one billion, one hundred eleven million, one hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •