Base | Representation |
---|---|
bin | 1010111011101110001000… |
… | …0111001000001000011101 |
3 | 1120120012120222001111120111 |
4 | 2232323202013020020131 |
5 | 3033423214133411331 |
6 | 41322231141450021 |
7 | 2350332235115554 |
oct | 256734207101035 |
9 | 46505528044514 |
10 | 12021112013341 |
11 | 3915141383a12 |
12 | 1421932110911 |
13 | 692780593282 |
14 | 2d7b7984cd9b |
15 | 15ca6b5e6db1 |
hex | aeee21c821d |
12021112013341 has 2 divisors, whose sum is σ = 12021112013342. Its totient is φ = 12021112013340.
The previous prime is 12021112013299. The next prime is 12021112013359. The reversal of 12021112013341 is 14331021112021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11975510119225 + 45601894116 = 3460565^2 + 213546^2 .
It is an emirp because it is prime and its reverse (14331021112021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12021112013341 - 215 = 12021111980573 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12021112013641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6010556006670 + 6010556006671.
It is an arithmetic number, because the mean of its divisors is an integer number (6010556006671).
Almost surely, 212021112013341 is an apocalyptic number.
It is an amenable number.
12021112013341 is a deficient number, since it is larger than the sum of its proper divisors (1).
12021112013341 is an equidigital number, since it uses as much as digits as its factorization.
12021112013341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 12021112013341 its reverse (14331021112021), we get a palindrome (26352133125362).
The spelling of 12021112013341 in words is "twelve trillion, twenty-one billion, one hundred twelve million, thirteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •