Base | Representation |
---|---|
bin | 10011100010011101… |
… | …01110111000000110 |
3 | 1000002001002000021100 |
4 | 21301032232320012 |
5 | 132440320401042 |
6 | 4452513000530 |
7 | 520641213255 |
oct | 116116567006 |
9 | 30061060240 |
10 | 10489622022 |
11 | 44a3133310 |
12 | 2048b53146 |
13 | cb227a949 |
14 | 7171b679c |
15 | 415d7624c |
hex | 2713aee06 |
10489622022 has 24 divisors (see below), whose sum is σ = 24793652520. Its totient is φ = 3178673280.
The previous prime is 10489621991. The next prime is 10489622027. The reversal of 10489622022 is 22022698401.
10489622022 is a `hidden beast` number, since 1 + 0 + 4 + 8 + 9 + 622 + 0 + 22 = 666.
10489622022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×104896220222 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10489622027) 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 11 ways as a sum of consecutive naturals, for example, 26488747 + ... + 26489142.
It is an arithmetic number, because the mean of its divisors is an integer number (1033068855).
Almost surely, 210489622022 is an apocalyptic number.
10489622022 is an abundant number, since it is smaller than the sum of its proper divisors (14304030498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10489622022 is a wasteful number, since it uses less digits than its factorization.
10489622022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52977908 (or 52977905 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The spelling of 10489622022 in words is "ten billion, four hundred eighty-nine million, six hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •