Base | Representation |
---|---|
bin | 10000011100101100011… |
… | …000111110101001101111 |
3 | 11000001120000122111110001 |
4 | 100130230120332221233 |
5 | 122004344203110211 |
6 | 2223132400525131 |
7 | 144443261126353 |
oct | 20345430765157 |
9 | 4001500574401 |
10 | 1130321144431 |
11 | 3a6403900646 |
12 | 1630923207a7 |
13 | 8278686245b |
14 | 3c9ca42b463 |
15 | 1e6078b3ac1 |
hex | 1072c63ea6f |
1130321144431 has 16 divisors (see below), whose sum is σ = 1228368245760. Its totient is φ = 1036139567040.
The previous prime is 1130321144429. The next prime is 1130321144437. The reversal of 1130321144431 is 1344411230311.
It is a cyclic number.
It is not a de Polignac number, because 1130321144431 - 21 = 1130321144429 is a prime.
It is a super-2 number, since 2×11303211444312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1130321144431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130321144437) 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, 4099635 + ... + 4366651.
It is an arithmetic number, because the mean of its divisors is an integer number (76773015360).
Almost surely, 21130321144431 is an apocalyptic number.
1130321144431 is a deficient number, since it is larger than the sum of its proper divisors (98047101329).
1130321144431 is a wasteful number, since it uses less digits than its factorization.
1130321144431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 274254.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 1130321144431 its reverse (1344411230311), we get a palindrome (2474732374742).
The spelling of 1130321144431 in words is "one trillion, one hundred thirty billion, three hundred twenty-one million, one hundred forty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •