Base | Representation |
---|---|
bin | 1011000001100111111111… |
… | …0001011000110011111111 |
3 | 1120220220101202021022011101 |
4 | 2300121333301120303333 |
5 | 3042103431042044211 |
6 | 41441004004433531 |
7 | 2360552606264563 |
oct | 260317761306377 |
9 | 46826352238141 |
10 | 12122541362431 |
11 | 3954160624155 |
12 | 143951a6a88a7 |
13 | 69c1c62590b6 |
14 | 2dca3c6616a3 |
15 | 1605060725c1 |
hex | b067fc58cff |
12122541362431 has 4 divisors (see below), whose sum is σ = 12142317123832. Its totient is φ = 12102765601032.
The previous prime is 12122541362429. The next prime is 12122541362483. The reversal of 12122541362431 is 13426314522121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12122541362431 - 21 = 12122541362429 is a prime.
It is a super-2 number, since 2×121225413624312 (a number of 27 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 (12122541362131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9887879781 + ... + 9887881006.
It is an arithmetic number, because the mean of its divisors is an integer number (3035579280958).
Almost surely, 212122541362431 is an apocalyptic number.
12122541362431 is a deficient number, since it is larger than the sum of its proper divisors (19775761401).
12122541362431 is an equidigital number, since it uses as much as digits as its factorization.
12122541362431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19775761400.
The product of its digits is 69120, while the sum is 37.
Adding to 12122541362431 its reverse (13426314522121), we get a palindrome (25548855884552).
The spelling of 12122541362431 in words is "twelve trillion, one hundred twenty-two billion, five hundred forty-one million, three hundred sixty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •