Base | Representation |
---|---|
bin | 10000001011000110011… |
… | …110000011110011010111 |
3 | 10221020210120010112220112 |
4 | 100023012132003303113 |
5 | 121202202410043111 |
6 | 2210330130353235 |
7 | 143204206303160 |
oct | 20130636036327 |
9 | 3836716115815 |
10 | 1111431331031 |
11 | 3993a001420a |
12 | 15b4a012b81b |
13 | 80a66193c88 |
14 | 3bb17776767 |
15 | 1dd9e341e8b |
hex | 102c6783cd7 |
1111431331031 has 8 divisors (see below), whose sum is σ = 1273140742944. Its totient is φ = 950455296000.
The previous prime is 1111431331009. The next prime is 1111431331033. The reversal of 1111431331031 is 1301331341111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1111431331031 - 218 = 1111431068887 is a prime.
It is a super-2 number, since 2×11114313310312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1111431330988 and 1111431331006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111431331033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 183340970 + ... + 183347031.
It is an arithmetic number, because the mean of its divisors is an integer number (159142592868).
Almost surely, 21111431331031 is an apocalyptic number.
1111431331031 is a deficient number, since it is larger than the sum of its proper divisors (161709411913).
1111431331031 is an equidigital number, since it uses as much as digits as its factorization.
1111431331031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 366688441.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 1111431331031 its reverse (1301331341111), we get a palindrome (2412762672142).
The spelling of 1111431331031 in words is "one trillion, one hundred eleven billion, four hundred thirty-one million, three hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •