Base | Representation |
---|---|
bin | 1010111011110010100110… |
… | …1101000100101100101001 |
3 | 1120120022200200012012211011 |
4 | 2232330221231010230221 |
5 | 3033433144131034311 |
6 | 41322550250103521 |
7 | 2350404061420543 |
oct | 256745155045451 |
9 | 46508620165734 |
10 | 12022313143081 |
11 | 39156a839151a |
12 | 142200841aba1 |
13 | 692912391a27 |
14 | 2d7c51194693 |
15 | 15cadbca7321 |
hex | aef29b44b29 |
12022313143081 has 2 divisors, whose sum is σ = 12022313143082. Its totient is φ = 12022313143080.
The previous prime is 12022313143069. The next prime is 12022313143151. The reversal of 12022313143081 is 18034131322021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11441028886681 + 581284256400 = 3382459^2 + 762420^2 .
It is a cyclic number.
It is not a de Polignac number, because 12022313143081 - 27 = 12022313142953 is a prime.
It is a super-2 number, since 2×120223131430812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12022313843081) 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, 6011156571540 + 6011156571541.
It is an arithmetic number, because the mean of its divisors is an integer number (6011156571541).
Almost surely, 212022313143081 is an apocalyptic number.
It is an amenable number.
12022313143081 is a deficient number, since it is larger than the sum of its proper divisors (1).
12022313143081 is an equidigital number, since it uses as much as digits as its factorization.
12022313143081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 31.
The spelling of 12022313143081 in words is "twelve trillion, twenty-two billion, three hundred thirteen million, one hundred forty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •