Base | Representation |
---|---|
bin | 10101010111111010… |
… | …101000111000010000 |
3 | 2012020102010221212221 |
4 | 111113322220320100 |
5 | 334000123413224 |
6 | 14313142230424 |
7 | 1441501205614 |
oct | 252772507020 |
9 | 65212127787 |
10 | 22949826064 |
11 | 9807640000 |
12 | 4545a25414 |
13 | 2219872849 |
14 | 1179d8b344 |
15 | 8e4bed6e4 |
hex | 557ea8e10 |
22949826064 has 75 divisors (see below), whose sum is σ = 49068279165. Its totient is φ = 10398410880.
The previous prime is 22949826061. The next prime is 22949826079. The reversal of 22949826064 is 46062894922.
The square root of 22949826064 is 151492.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 146410000 + 22803416064 = 12100^2 + 151008^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22949826061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 73321972 + ... + 73322284.
Almost surely, 222949826064 is an apocalyptic number.
22949826064 is the 151492-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22949826064
22949826064 is an abundant number, since it is smaller than the sum of its proper divisors (26118453101).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22949826064 is an frugal number, since it uses more digits than its factorization.
22949826064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 678 (or 326 counting only the distinct ones).
The product of its (nonzero) digits is 2985984, while the sum is 52.
The spelling of 22949826064 in words is "twenty-two billion, nine hundred forty-nine million, eight hundred twenty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •