Base | Representation |
---|---|
bin | 10101010111000110… |
… | …000000101101000000 |
3 | 2012012110012001021012 |
4 | 111113012000231000 |
5 | 333433110430031 |
6 | 14311530420052 |
7 | 1441243016114 |
oct | 252706005500 |
9 | 65173161235 |
10 | 22936030016 |
11 | 97aa877909 |
12 | 4541291628 |
13 | 2216a521c3 |
14 | 11781d9744 |
15 | 8e38c5b2b |
hex | 557180b40 |
22936030016 has 56 divisors (see below), whose sum is σ = 47625755904. Its totient is φ = 10945981440.
The previous prime is 22936029971. The next prime is 22936030037. The reversal of 22936030016 is 61003063922.
It is a super-2 number, since 2×229360300162 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65651 + ... + 224013.
Almost surely, 222936030016 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22936030016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23812877952).
22936030016 is an abundant number, since it is smaller than the sum of its proper divisors (24689725888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22936030016 is a wasteful number, since it uses less digits than its factorization.
22936030016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158479 (or 158469 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 32.
Adding to 22936030016 its reverse (61003063922), we get a palindrome (83939093938).
The spelling of 22936030016 in words is "twenty-two billion, nine hundred thirty-six million, thirty thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •