Base | Representation |
---|---|
bin | 10010101010101111… |
… | …01100111000011000 |
3 | 221212110120002000120 |
4 | 21111113230320120 |
5 | 131011141223341 |
6 | 4334254433240 |
7 | 503234250222 |
oct | 112527547030 |
9 | 27773502016 |
10 | 10022211096 |
11 | 4283305597 |
12 | 1b38502820 |
13 | c39496131 |
14 | 6b10a5412 |
15 | 3d9ce9066 |
hex | 2555ece18 |
10022211096 has 64 divisors (see below), whose sum is σ = 25382522880. Its totient is φ = 3297409920.
The previous prime is 10022211083. The next prime is 10022211097. The reversal of 10022211096 is 69011222001.
10022211096 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10022211097) 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 15 ways as a sum of consecutive naturals, for example, 592111 + ... + 608801.
It is an arithmetic number, because the mean of its divisors is an integer number (396601920).
Almost surely, 210022211096 is an apocalyptic number.
It is an amenable number.
10022211096 is an abundant number, since it is smaller than the sum of its proper divisors (15360311784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10022211096 is a wasteful number, since it uses less digits than its factorization.
10022211096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17024 (or 17020 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 10022211096 its reverse (69011222001), we get a palindrome (79033433097).
The spelling of 10022211096 in words is "ten billion, twenty-two million, two hundred eleven thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •