Base | Representation |
---|---|
bin | 10000100000001110111… |
… | …001110110000111010111 |
3 | 11000102100212112001011212 |
4 | 100200032321312013113 |
5 | 122040140040123111 |
6 | 2225001433452035 |
7 | 144636404636000 |
oct | 20401671660727 |
9 | 4012325461155 |
10 | 1134121411031 |
11 | 3a7a83a74144 |
12 | 163972b7101b |
13 | 82c40c9100b |
14 | 3cc6b02c1a7 |
15 | 1e77b33398b |
hex | 1080ee761d7 |
1134121411031 has 16 divisors (see below), whose sum is σ = 1322661888000. Its totient is φ = 972051646104.
The previous prime is 1134121411021. The next prime is 1134121411051. The reversal of 1134121411031 is 1301141214311.
It is not a de Polignac number, because 1134121411031 - 26 = 1134121410967 is a prime.
It is a super-2 number, since 2×11341214110312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1134121410988 and 1134121411006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1134121411021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7132250 + ... + 7289528.
It is an arithmetic number, because the mean of its divisors is an integer number (82666368000).
Almost surely, 21134121411031 is an apocalyptic number.
1134121411031 is a deficient number, since it is larger than the sum of its proper divisors (188540476969).
1134121411031 is an equidigital number, since it uses as much as digits as its factorization.
1134121411031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178323 (or 178309 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 1134121411031 its reverse (1301141214311), we get a palindrome (2435262625342).
The spelling of 1134121411031 in words is "one trillion, one hundred thirty-four billion, one hundred twenty-one million, four hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •