Base | Representation |
---|---|
bin | 10100100000101100… |
… | …001110100010110101 |
3 | 2002211211201121211222 |
4 | 110200230032202311 |
5 | 330100431120201 |
6 | 14041203440125 |
7 | 1406520654341 |
oct | 244054164265 |
9 | 62754647758 |
10 | 22023301301 |
11 | 9381641261 |
12 | 4327686045 |
13 | 20cc91cc41 |
14 | 10cccc8621 |
15 | 88d6d291b |
hex | 520b0e8b5 |
22023301301 has 8 divisors (see below), whose sum is σ = 22049458200. Its totient is φ = 21997163520.
The previous prime is 22023301291. The next prime is 22023301303. The reversal of 22023301301 is 10310332022.
It can be written as a sum of positive squares in 4 ways, for example, as 5162278801 + 16861022500 = 71849^2 + 129850^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22023301301 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22023301301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22023301303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3943331 + ... + 3948911.
It is an arithmetic number, because the mean of its divisors is an integer number (2756182275).
Almost surely, 222023301301 is an apocalyptic number.
It is an amenable number.
22023301301 is a deficient number, since it is larger than the sum of its proper divisors (26156899).
22023301301 is a wasteful number, since it uses less digits than its factorization.
22023301301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9559.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 22023301301 its reverse (10310332022), we get a palindrome (32333633323).
The spelling of 22023301301 in words is "twenty-two billion, twenty-three million, three hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •