Base | Representation |
---|---|
bin | 1001001011111010001011… |
… | …0101011010000001011110 |
3 | 1022202120101022020202211101 |
4 | 2102332202311122001132 |
5 | 2310440202201201420 |
6 | 33251545015143314 |
7 | 2061500241441532 |
oct | 222764265320136 |
9 | 38676338222741 |
10 | 10100200022110 |
11 | 324451a667750 |
12 | 11715a0674b3a |
13 | 5835a222c333 |
14 | 26cbd0979bc2 |
15 | 127ae19dd60a |
hex | 92fa2d5a05e |
10100200022110 has 32 divisors (see below), whose sum is σ = 20018476328832. Its totient is φ = 3638474770080.
The previous prime is 10100200022057. The next prime is 10100200022113. The reversal of 10100200022110 is 1122000200101.
10100200022110 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 (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100200022113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 429053652 + ... + 429077191.
It is an arithmetic number, because the mean of its divisors is an integer number (625577385276).
Almost surely, 210100200022110 is an apocalyptic number.
10100200022110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10100200022110 is a deficient number, since it is larger than the sum of its proper divisors (9918276306722).
10100200022110 is a wasteful number, since it uses less digits than its factorization.
10100200022110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 858130968.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10100200022110 its reverse (1122000200101), we get a palindrome (11222200222211).
The spelling of 10100200022110 in words is "ten trillion, one hundred billion, two hundred million, twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •