Base | Representation |
---|---|
bin | 10000010100010011011… |
… | …110011100001010011000 |
3 | 10222012022020122001212010 |
4 | 100110103132130022120 |
5 | 121332422140223112 |
6 | 2215042453345520 |
7 | 144004121014020 |
oct | 20242336341230 |
9 | 3865266561763 |
10 | 1121313211032 |
11 | 3a2601090993 |
12 | 1613996382a0 |
13 | 8197c565151 |
14 | 3c3b3d4ca80 |
15 | 1e27bb6b63c |
hex | 1051379c298 |
1121313211032 has 64 divisors (see below), whose sum is σ = 3204907038720. Its totient is φ = 320259702528.
The previous prime is 1121313211019. The next prime is 1121313211049. The reversal of 1121313211032 is 2301123131211.
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 15 ways as a sum of consecutive naturals, for example, 735208 + ... + 1668279.
It is an arithmetic number, because the mean of its divisors is an integer number (50076672480).
Almost surely, 21121313211032 is an apocalyptic number.
1121313211032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1121313211032 is an abundant number, since it is smaller than the sum of its proper divisors (2083593827688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121313211032 is a wasteful number, since it uses less digits than its factorization.
1121313211032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2406280 (or 2406276 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1121313211032 its reverse (2301123131211), we get a palindrome (3422436342243).
The spelling of 1121313211032 in words is "one trillion, one hundred twenty-one billion, three hundred thirteen million, two hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •