Base | Representation |
---|---|
bin | 1011001001000111010111… |
… | …1111100101110001000111 |
3 | 1121101012120000202002110222 |
4 | 2302101311333211301013 |
5 | 3101211002420112411 |
6 | 42020045150134555 |
7 | 2403056544421625 |
oct | 262216577456107 |
9 | 47335500662428 |
10 | 12251226332231 |
11 | 39a379696a667 |
12 | 145a452ab145b |
13 | 6ab393862643 |
14 | 304d69216515 |
15 | 163a387274db |
hex | b2475fe5c47 |
12251226332231 has 2 divisors, whose sum is σ = 12251226332232. Its totient is φ = 12251226332230.
The previous prime is 12251226332221. The next prime is 12251226332369. The reversal of 12251226332231 is 13223362215221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12251226332231 - 26 = 12251226332167 is a prime.
It is a super-2 number, since 2×122512263322312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 12251226332191 and 12251226332200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12251226332221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6125613166115 + 6125613166116.
It is an arithmetic number, because the mean of its divisors is an integer number (6125613166116).
Almost surely, 212251226332231 is an apocalyptic number.
12251226332231 is a deficient number, since it is larger than the sum of its proper divisors (1).
12251226332231 is an equidigital number, since it uses as much as digits as its factorization.
12251226332231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 51840, while the sum is 35.
Adding to 12251226332231 its reverse (13223362215221), we get a palindrome (25474588547452).
The spelling of 12251226332231 in words is "twelve trillion, two hundred fifty-one billion, two hundred twenty-six million, three hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •