Base | Representation |
---|---|
bin | 10010101000000111… |
… | …10011111101110110 |
3 | 221210221011210221100 |
4 | 21110003303331312 |
5 | 130440024020042 |
6 | 4332151230530 |
7 | 502546316262 |
oct | 112403637566 |
9 | 27727153840 |
10 | 10000220022 |
11 | 4271955351 |
12 | 1b31078446 |
13 | c34a66670 |
14 | 6ac1bd0a2 |
15 | 3d7e0324c |
hex | 2540f3f76 |
10000220022 has 48 divisors (see below), whose sum is σ = 23341002048. Its totient is φ = 3076047360.
The previous prime is 10000219997. The next prime is 10000220023. The reversal of 10000220022 is 22002200001.
It is a Harshad number since it is a multiple of its sum of digits (9).
10000220022 is a modest number, since divided by 220022 gives 100 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 10000219986 and 10000220013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000220023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1426947 + ... + 1433937.
It is an arithmetic number, because the mean of its divisors is an integer number (486270876).
Almost surely, 210000220022 is an apocalyptic number.
10000220022 is an abundant number, since it is smaller than the sum of its proper divisors (13340782026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000220022 is a wasteful number, since it uses less digits than its factorization.
10000220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13125 (or 13122 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
Adding to 10000220022 its reverse (22002200001), we get a palindrome (32002420023).
The spelling of 10000220022 in words is "ten billion, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •