Base | Representation |
---|---|
bin | 1010111011001100111110… |
… | …0001001110000001101011 |
3 | 1120112100121120122001211221 |
4 | 2232303033201032001223 |
5 | 3033302001244322111 |
6 | 41314155544002511 |
7 | 2346565523413642 |
oct | 256631741160153 |
9 | 46470546561757 |
10 | 12012210151531 |
11 | 3911393522427 |
12 | 1420068a60437 |
13 | 691992254215 |
14 | 2d75734a2359 |
15 | 15c6e9d53371 |
hex | aeccf84e06b |
12012210151531 has 2 divisors, whose sum is σ = 12012210151532. Its totient is φ = 12012210151530.
The previous prime is 12012210151483. The next prime is 12012210151589. The reversal of 12012210151531 is 13515101221021.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12012210151531 is a prime.
It is a super-2 number, since 2×120122101515312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12012210151496 and 12012210151505.
It is not a weakly prime, because it can be changed into another prime (12012210154531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6006105075765 + 6006105075766.
It is an arithmetic number, because the mean of its divisors is an integer number (6006105075766).
Almost surely, 212012210151531 is an apocalyptic number.
12012210151531 is a deficient number, since it is larger than the sum of its proper divisors (1).
12012210151531 is an equidigital number, since it uses as much as digits as its factorization.
12012210151531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 600, while the sum is 25.
Adding to 12012210151531 its reverse (13515101221021), we get a palindrome (25527311372552).
The spelling of 12012210151531 in words is "twelve trillion, twelve billion, two hundred ten million, one hundred fifty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •