Base | Representation |
---|---|
bin | 1011000110101110111100… |
… | …1100100110110001111111 |
3 | 1121020021221111122212102220 |
4 | 2301223233030212301333 |
5 | 3100023203342130211 |
6 | 41545201121420423 |
7 | 2400110603335122 |
oct | 261535714466177 |
9 | 47207844585386 |
10 | 12210310114431 |
11 | 39883aa812630 |
12 | 145253419a713 |
13 | 6a7572a28990 |
14 | 302da70aa3b9 |
15 | 1629415ad806 |
hex | b1aef326c7f |
12210310114431 has 64 divisors (see below), whose sum is σ = 20263676428800. Its totient is φ = 6425331978240.
The previous prime is 12210310114417. The next prime is 12210310114441. The reversal of 12210310114431 is 13441101301221.
It is not a de Polignac number, because 12210310114431 - 211 = 12210310112383 is a prime.
It is a super-2 number, since 2×122103101144312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210310114441) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11898091 + ... + 12883523.
It is an arithmetic number, because the mean of its divisors is an integer number (316619944200).
Almost surely, 212210310114431 is an apocalyptic number.
12210310114431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12210310114431 is a deficient number, since it is larger than the sum of its proper divisors (8053366314369).
12210310114431 is a wasteful number, since it uses less digits than its factorization.
12210310114431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 987176.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 12210310114431 its reverse (13441101301221), we get a palindrome (25651411415652).
The spelling of 12210310114431 in words is "twelve trillion, two hundred ten billion, three hundred ten million, one hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •