Base | Representation |
---|---|
bin | 10000001011000110011… |
… | …101010000110011001000 |
3 | 10221020210112201221100002 |
4 | 100023012131100303020 |
5 | 121202202331401440 |
6 | 2210330122102132 |
7 | 143204204443124 |
oct | 20130635206310 |
9 | 3836715657302 |
10 | 1111431122120 |
11 | 39939a991260 |
12 | 15b4a004a948 |
13 | 80a6611cb67 |
14 | 3bb17720584 |
15 | 1dd9e300115 |
hex | 102c6750cc8 |
1111431122120 has 64 divisors (see below), whose sum is σ = 2728340020800. Its totient is φ = 404115022080.
The previous prime is 1111431122119. The next prime is 1111431122147. The reversal of 1111431122120 is 212211341111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1111431122092 and 1111431122101.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4304927 + ... + 4555793.
It is an arithmetic number, because the mean of its divisors is an integer number (42630312825).
Almost surely, 21111431122120 is an apocalyptic number.
1111431122120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1111431122120 is an abundant number, since it is smaller than the sum of its proper divisors (1616908898680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111431122120 is a wasteful number, since it uses less digits than its factorization.
1111431122120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 260958 (or 260954 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 1111431122120 its reverse (212211341111), we get a palindrome (1323642463231).
The spelling of 1111431122120 in words is "one trillion, one hundred eleven billion, four hundred thirty-one million, one hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •