Base | Representation |
---|---|
bin | 10010110101001110… |
… | …11100001011111100 |
3 | 222002121011112210102 |
4 | 21122213130023330 |
5 | 131201204114400 |
6 | 4351121100232 |
7 | 505353323045 |
oct | 113247341374 |
9 | 28077145712 |
10 | 10110223100 |
11 | 4318a5928a |
12 | 1b61a87678 |
13 | c517a0243 |
14 | 6bca558cc |
15 | 3e28d19d5 |
hex | 25a9dc2fc |
10110223100 has 36 divisors (see below), whose sum is σ = 21986264664. Its totient is φ = 4035410880.
The previous prime is 10110223073. The next prime is 10110223103. The reversal of 10110223100 is 132201101.
It is a super-2 number, since 2×101102231002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110223103) 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 11 ways as a sum of consecutive naturals, for example, 61547 + ... + 154946.
It is an arithmetic number, because the mean of its divisors is an integer number (610729574).
Almost surely, 210110223100 is an apocalyptic number.
10110223100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10110223100 is an abundant number, since it is smaller than the sum of its proper divisors (11876041564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110223100 is a wasteful number, since it uses less digits than its factorization.
10110223100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216974 (or 216967 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10110223100 its reverse (132201101), we get a palindrome (10242424201).
The spelling of 10110223100 in words is "ten billion, one hundred ten million, two hundred twenty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •