Base | Representation |
---|---|
bin | 10010101000001111… |
… | …01000010101111101 |
3 | 221211000001200000012 |
4 | 21110013220111331 |
5 | 130440303032424 |
6 | 4332224513005 |
7 | 502560655454 |
oct | 112407502575 |
9 | 27730050005 |
10 | 10001220989 |
11 | 42724793a1 |
12 | 1b3147b765 |
13 | c35027156 |
14 | 6ac39db9b |
15 | 3d804eb0e |
hex | 2541e857d |
10001220989 has 12 divisors (see below), whose sum is σ = 10721637300. Its totient is φ = 9326527488.
The previous prime is 10001220947. The next prime is 10001221001. The reversal of 10001220989 is 98902210001.
It is a happy number.
10001220989 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 1474176025 + 8527044964 = 38395^2 + 92342^2 .
It is a de Polignac number, because none of the positive numbers 2k-10001220989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001240989) 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, 127244 + ... + 190245.
It is an arithmetic number, because the mean of its divisors is an integer number (893469775).
Almost surely, 210001220989 is an apocalyptic number.
It is an amenable number.
10001220989 is a deficient number, since it is larger than the sum of its proper divisors (720416311).
10001220989 is a wasteful number, since it uses less digits than its factorization.
10001220989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317632 (or 317615 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 32.
The spelling of 10001220989 in words is "ten billion, one million, two hundred twenty thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •