Base | Representation |
---|---|
bin | 1000100101000110… |
… | …1101001010010110 |
3 | 12221111201121201120 |
4 | 2021101231022112 |
5 | 14204044320042 |
6 | 1020311504410 |
7 | 111034124430 |
oct | 21121551226 |
9 | 5844647646 |
10 | 2303120022 |
11 | a82062185 |
12 | 543388106 |
13 | 2a91c8318 |
14 | 17bc41650 |
15 | d72dadec |
hex | 8946d296 |
2303120022 has 64 divisors (see below), whose sum is σ = 5395783680. Its totient is φ = 641800224.
The previous prime is 2303119963. The next prime is 2303120023. The reversal of 2303120022 is 2200213032.
It is a junction number, because it is equal to n+sod(n) for n = 2303119983 and 2303120010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2303120023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 271213 + ... + 279575.
It is an arithmetic number, because the mean of its divisors is an integer number (84309120).
Almost surely, 22303120022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2303120022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2697891840).
2303120022 is an abundant number, since it is smaller than the sum of its proper divisors (3092663658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2303120022 is a wasteful number, since it uses less digits than its factorization.
2303120022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8537.
The product of its (nonzero) digits is 144, while the sum is 15.
The square root of 2303120022 is about 47990.8326870872. The cubic root of 2303120022 is about 1320.6027286473.
Adding to 2303120022 its reverse (2200213032), we get a palindrome (4503333054).
The spelling of 2303120022 in words is "two billion, three hundred three million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •