Base | Representation |
---|---|
bin | 110011001110010101… |
… | …1110011101101100111 |
3 | 101111221021212221000202 |
4 | 1212130223303231213 |
5 | 3300241221141403 |
6 | 122311252101115 |
7 | 10642655216360 |
oct | 1463453635547 |
9 | 344837787022 |
10 | 110002912103 |
11 | 4271985a007 |
12 | 1939b90479b |
13 | a4b0ca9546 |
14 | 5477740b67 |
15 | 2cdc4c0688 |
hex | 199caf3b67 |
110002912103 has 16 divisors (see below), whose sum is σ = 127703595264. Its totient is φ = 92801142720.
The previous prime is 110002912091. The next prime is 110002912109. The reversal of 110002912103 is 301219200011.
It is a cyclic number.
It is not a de Polignac number, because 110002912103 - 216 = 110002846567 is a prime.
It is a super-2 number, since 2×1100029121032 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110002912109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 449051 + ... + 649347.
It is an arithmetic number, because the mean of its divisors is an integer number (7981474704).
Almost surely, 2110002912103 is an apocalyptic number.
110002912103 is a deficient number, since it is larger than the sum of its proper divisors (17700683161).
110002912103 is a wasteful number, since it uses less digits than its factorization.
110002912103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201542.
The product of its (nonzero) digits is 108, while the sum is 20.
The spelling of 110002912103 in words is "one hundred ten billion, two million, nine hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •