Base | Representation |
---|---|
bin | 10000010100001000101… |
… | …000001011000011100111 |
3 | 10222011211120011121112102 |
4 | 100110020220023003213 |
5 | 121332034042304111 |
6 | 2215012432442315 |
7 | 143666451034424 |
oct | 20241050130347 |
9 | 3864746147472 |
10 | 1121131213031 |
11 | 3a2518384115 |
12 | 1613486a939b |
13 | 81950941a1b |
14 | 3c397ad4d4b |
15 | 1e26abbb13b |
hex | 10508a0b0e7 |
1121131213031 has 16 divisors (see below), whose sum is σ = 1229383372800. Its totient is φ = 1018432245600.
The previous prime is 1121131213003. The next prime is 1121131213043. The reversal of 1121131213031 is 1303121311211.
It is a cyclic number.
It is not a de Polignac number, because 1121131213031 - 210 = 1121131212007 is a prime.
It is a super-2 number, since 2×11211312130312 (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 = 1121131212994 and 1121131213012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121131213051) 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, 8667215 + ... + 8795616.
It is an arithmetic number, because the mean of its divisors is an integer number (76836460800).
Almost surely, 21121131213031 is an apocalyptic number.
1121131213031 is a deficient number, since it is larger than the sum of its proper divisors (108252159769).
1121131213031 is a wasteful number, since it uses less digits than its factorization.
1121131213031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17462990.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 1121131213031 its reverse (1303121311211), we get a palindrome (2424252524242).
The spelling of 1121131213031 in words is "one trillion, one hundred twenty-one billion, one hundred thirty-one million, two hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •