Base | Representation |
---|---|
bin | 1010001101011010110110… |
… | …00001011010111011110001 |
3 | 2221111022210011200112121202 |
4 | 11012231123001122323301 |
5 | 10420320301203432223 |
6 | 115425554453500545 |
7 | 4505024445034331 |
oct | 506553301327361 |
9 | 87438704615552 |
10 | 22451321155313 |
11 | 717660853a866 |
12 | 2627272041755 |
13 | c6b1c585a35b |
14 | 578914c6b0c1 |
15 | 28e0250c0428 |
hex | 146b5b05aef1 |
22451321155313 has 2 divisors, whose sum is σ = 22451321155314. Its totient is φ = 22451321155312.
The previous prime is 22451321155231. The next prime is 22451321155327. The reversal of 22451321155313 is 31355112315422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21792249959089 + 659071196224 = 4668217^2 + 811832^2 .
It is a cyclic number.
It is not a de Polignac number, because 22451321155313 - 28 = 22451321155057 is a prime.
It is a super-3 number, since 3×224513211553133 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (22451321157313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11225660577656 + 11225660577657.
It is an arithmetic number, because the mean of its divisors is an integer number (11225660577657).
Almost surely, 222451321155313 is an apocalyptic number.
It is an amenable number.
22451321155313 is a deficient number, since it is larger than the sum of its proper divisors (1).
22451321155313 is an equidigital number, since it uses as much as digits as its factorization.
22451321155313 is an evil number, because the sum of its binary digits is even.
The product of its digits is 108000, while the sum is 38.
The spelling of 22451321155313 in words is "twenty-two trillion, four hundred fifty-one billion, three hundred twenty-one million, one hundred fifty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •