Base | Representation |
---|---|
bin | 101101011001110101001… |
… | …111101011101011010111 |
3 | 102001021120001122020101111 |
4 | 231121311033223223113 |
5 | 402104443001132411 |
6 | 10345205452235451 |
7 | 441264213323512 |
oct | 55316517535327 |
9 | 12037501566344 |
10 | 3120113302231 |
11 | aa3261688502 |
12 | 42484776bb87 |
13 | 1982c13376c3 |
14 | ab02b2d3d79 |
15 | 5626462a721 |
hex | 2d6753ebad7 |
3120113302231 has 32 divisors (see below), whose sum is σ = 3435475415040. Its totient is φ = 2824512768000.
The previous prime is 3120113302181. The next prime is 3120113302237. The reversal of 3120113302231 is 1322033110213.
It is a cyclic number.
It is not a de Polignac number, because 3120113302231 - 29 = 3120113301719 is a prime.
It is a super-2 number, since 2×31201133022312 (a number of 26 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 (3120113302237) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7926781 + ... + 8311081.
It is an arithmetic number, because the mean of its divisors is an integer number (107358606720).
Almost surely, 23120113302231 is an apocalyptic number.
3120113302231 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
3120113302231 is a deficient number, since it is larger than the sum of its proper divisors (315362112809).
3120113302231 is a wasteful number, since it uses less digits than its factorization.
3120113302231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384607.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 3120113302231 its reverse (1322033110213), we get a palindrome (4442146412444).
The spelling of 3120113302231 in words is "three trillion, one hundred twenty billion, one hundred thirteen million, three hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •