Base | Representation |
---|---|
bin | 1011000010000100101000… |
… | …0111111010101100000011 |
3 | 1120221122020200010012211221 |
4 | 2300201022013322230003 |
5 | 3042220203143431113 |
6 | 41444315025215511 |
7 | 2361244303150252 |
oct | 260411207725403 |
9 | 46848220105757 |
10 | 12130231233283 |
11 | 3957447329a19 |
12 | 143ab05a91597 |
13 | 69cb50465b37 |
14 | 2dd16ba7a799 |
15 | 16080620c98d |
hex | b084a1fab03 |
12130231233283 has 2 divisors, whose sum is σ = 12130231233284. Its totient is φ = 12130231233282.
The previous prime is 12130231233199. The next prime is 12130231233317. The reversal of 12130231233283 is 38233213203121.
It is an a-pointer prime, because the next prime (12130231233317) can be obtained adding 12130231233283 to its sum of digits (34).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12130231233283 - 221 = 12130229136131 is a prime.
It is a super-2 number, since 2×121302312332832 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12130231233983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6065115616641 + 6065115616642.
It is an arithmetic number, because the mean of its divisors is an integer number (6065115616642).
Almost surely, 212130231233283 is an apocalyptic number.
12130231233283 is a deficient number, since it is larger than the sum of its proper divisors (1).
12130231233283 is an equidigital number, since it uses as much as digits as its factorization.
12130231233283 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 34.
The spelling of 12130231233283 in words is "twelve trillion, one hundred thirty billion, two hundred thirty-one million, two hundred thirty-three thousand, two hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •