Base | Representation |
---|---|
bin | 1001001100100010011100… |
… | …1010001100110010010110 |
3 | 1022210121021200010112202200 |
4 | 2103020213022030302112 |
5 | 2311124322030000042 |
6 | 33300533414345330 |
7 | 2062332152645241 |
oct | 223104712146226 |
9 | 38717250115680 |
10 | 10111010000022 |
11 | 3249067608098 |
12 | 11736b895b246 |
13 | 584605984179 |
14 | 26d538504258 |
15 | 128025a44c4c |
hex | 9322728cc96 |
10111010000022 has 24 divisors (see below), whose sum is σ = 21908435090880. Its totient is φ = 3370144857840.
The previous prime is 10111009999999. The next prime is 10111010000059. The reversal of 10111010000022 is 22000001011101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10111009999959 and 10111010000013.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 15658822 + ... + 16291737.
It is an arithmetic number, because the mean of its divisors is an integer number (912851462120).
Almost surely, 210111010000022 is an apocalyptic number.
10111010000022 is an abundant number, since it is smaller than the sum of its proper divisors (11797425090858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111010000022 is a wasteful number, since it uses less digits than its factorization.
10111010000022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31968148 (or 31968145 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10111010000022 its reverse (22000001011101), we get a palindrome (32111011011123).
The spelling of 10111010000022 in words is "ten trillion, one hundred eleven billion, ten million, twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •