Base | Representation |
---|---|
bin | 1010111011110011000010… |
… | …1100011000111000101101 |
3 | 1120120022222211211200202101 |
4 | 2232330300230120320231 |
5 | 3033433414140413031 |
6 | 41323010035255101 |
7 | 2350410014213533 |
oct | 256746054307055 |
9 | 46508884750671 |
10 | 12022430404141 |
11 | 39157585a2493 |
12 | 142203b74a491 |
13 | 69293076a081 |
14 | 2d7c6299a153 |
15 | 15cae721b361 |
hex | aef30b18e2d |
12022430404141 has 2 divisors, whose sum is σ = 12022430404142. Its totient is φ = 12022430404140.
The previous prime is 12022430404123. The next prime is 12022430404151. The reversal of 12022430404141 is 14140403422021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10773959381641 + 1248471022500 = 3282371^2 + 1117350^2 .
It is a cyclic number.
It is not a de Polignac number, because 12022430404141 - 223 = 12022422015533 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12022430404151) 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, 6011215202070 + 6011215202071.
It is an arithmetic number, because the mean of its divisors is an integer number (6011215202071).
Almost surely, 212022430404141 is an apocalyptic number.
It is an amenable number.
12022430404141 is a deficient number, since it is larger than the sum of its proper divisors (1).
12022430404141 is an equidigital number, since it uses as much as digits as its factorization.
12022430404141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 12022430404141 its reverse (14140403422021), we get a palindrome (26162833826162).
The spelling of 12022430404141 in words is "twelve trillion, twenty-two billion, four hundred thirty million, four hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •