Base | Representation |
---|---|
bin | 10100101101000010… |
… | …011101000001001110 |
3 | 2010101021112002102010 |
4 | 110231002131001032 |
5 | 331011444014400 |
6 | 14113523442050 |
7 | 1414614513156 |
oct | 245502350116 |
9 | 63337462363 |
10 | 22230454350 |
11 | 947856a425 |
12 | 4384b26326 |
13 | 2133810000 |
14 | 110c60d766 |
15 | 8a19a1450 |
hex | 52d09d04e |
22230454350 has 120 divisors (see below), whose sum is σ = 59737169880. Its totient is φ = 5471057280.
The previous prime is 22230454349. The next prime is 22230454369. The reversal of 22230454350 is 5345403222.
It is a super-3 number, since 3×222304543503 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 4281556 + ... + 4286744.
It is an arithmetic number, because the mean of its divisors is an integer number (497809749).
Almost surely, 222230454350 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22230454350, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29868584940).
22230454350 is an abundant number, since it is smaller than the sum of its proper divisors (37506715530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22230454350 is an equidigital number, since it uses as much as digits as its factorization.
22230454350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5256 (or 5212 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 30.
Adding to 22230454350 its reverse (5345403222), we get a palindrome (27575857572).
The spelling of 22230454350 in words is "twenty-two billion, two hundred thirty million, four hundred fifty-four thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •