Base | Representation |
---|---|
bin | 10100110001010111… |
… | …011011010110011001 |
3 | 2010120100010220120011 |
4 | 110301113123112121 |
5 | 331134040431101 |
6 | 14125040001521 |
7 | 1416455615425 |
oct | 246127332631 |
9 | 63510126504 |
10 | 22303061401 |
11 | 9505551155 |
12 | 43a53002a1 |
13 | 214588236a |
14 | 111810db85 |
15 | 8a8044751 |
hex | 5315db599 |
22303061401 has 2 divisors, whose sum is σ = 22303061402. Its totient is φ = 22303061400.
The previous prime is 22303061399. The next prime is 22303061423. The reversal of 22303061401 is 10416030322.
It is an a-pointer prime, because the next prime (22303061423) can be obtained adding 22303061401 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20370140176 + 1932921225 = 142724^2 + 43965^2 .
It is a cyclic number.
It is not a de Polignac number, because 22303061401 - 21 = 22303061399 is a prime.
Together with 22303061399, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (22303065401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11151530700 + 11151530701.
It is an arithmetic number, because the mean of its divisors is an integer number (11151530701).
Almost surely, 222303061401 is an apocalyptic number.
It is an amenable number.
22303061401 is a deficient number, since it is larger than the sum of its proper divisors (1).
22303061401 is an equidigital number, since it uses as much as digits as its factorization.
22303061401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 22303061401 its reverse (10416030322), we get a palindrome (32719091723).
The spelling of 22303061401 in words is "twenty-two billion, three hundred three million, sixty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •