Base | Representation |
---|---|
bin | 10000011100100111000… |
… | …010010010101101111111 |
3 | 11000001022202121111110111 |
4 | 100130213002102231333 |
5 | 122004203203424411 |
6 | 2223115431250451 |
7 | 144441120430111 |
oct | 20344702225577 |
9 | 4001282544414 |
10 | 1130231311231 |
11 | 3a6368123630 |
12 | 163068219a27 |
13 | 8277106b409 |
14 | 3c9bc5253b1 |
15 | 1e5eea6b721 |
hex | 10727092b7f |
1130231311231 has 16 divisors (see below), whose sum is σ = 1234275614208. Its totient is φ = 1026403560000.
The previous prime is 1130231311217. The next prime is 1130231311241. The reversal of 1130231311231 is 1321131320311.
It is a cyclic number.
It is not a de Polignac number, because 1130231311231 - 25 = 1130231311199 is a prime.
It is a super-2 number, since 2×11302313112312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130231311241) 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, 48943770 + ... + 48966856.
It is an arithmetic number, because the mean of its divisors is an integer number (77142225888).
Almost surely, 21130231311231 is an apocalyptic number.
1130231311231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1130231311231 is a deficient number, since it is larger than the sum of its proper divisors (104044302977).
1130231311231 is a wasteful number, since it uses less digits than its factorization.
1130231311231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27582.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 1130231311231 its reverse (1321131320311), we get a palindrome (2451362631542).
The spelling of 1130231311231 in words is "one trillion, one hundred thirty billion, two hundred thirty-one million, three hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •