Base | Representation |
---|---|
bin | 10100100000101011… |
… | …100000011001101101 |
3 | 2002211211101000120222 |
4 | 110200223200121231 |
5 | 330100404043201 |
6 | 14041155421125 |
7 | 1406516236331 |
oct | 244053403155 |
9 | 62754330528 |
10 | 22023112301 |
11 | 9381522263 |
12 | 43275b47a5 |
13 | 20cc884bc8 |
14 | 10ccc797c1 |
15 | 88d69691b |
hex | 520ae066d |
22023112301 has 2 divisors, whose sum is σ = 22023112302. Its totient is φ = 22023112300.
The previous prime is 22023112297. The next prime is 22023112303. The reversal of 22023112301 is 10321132022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21633997225 + 389115076 = 147085^2 + 19726^2 .
It is a cyclic number.
It is not a de Polignac number, because 22023112301 - 22 = 22023112297 is a prime.
It is a Sophie Germain prime.
Together with 22023112303, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 22023112301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22023112303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11011556150 + 11011556151.
It is an arithmetic number, because the mean of its divisors is an integer number (11011556151).
Almost surely, 222023112301 is an apocalyptic number.
It is an amenable number.
22023112301 is a deficient number, since it is larger than the sum of its proper divisors (1).
22023112301 is an equidigital number, since it uses as much as digits as its factorization.
22023112301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 22023112301 its reverse (10321132022), we get a palindrome (32344244323).
The spelling of 22023112301 in words is "twenty-two billion, twenty-three million, one hundred twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •