Base | Representation |
---|---|
bin | 110011001110010100… |
… | …1000110010110011101 |
3 | 101111221020112211222010 |
4 | 1212130221012112131 |
5 | 3300241030431023 |
6 | 122311224541433 |
7 | 10642646201214 |
oct | 1463451062635 |
9 | 344836484863 |
10 | 110002202013 |
11 | 42719414560 |
12 | 1939b621879 |
13 | a4b0abb282 |
14 | 54775d807b |
15 | 2cdc3d0093 |
hex | 199ca4659d |
110002202013 has 16 divisors (see below), whose sum is σ = 161587397952. Its totient is φ = 66007920000.
The previous prime is 110002201973. The next prime is 110002202027. The reversal of 110002202013 is 310202200011.
It is not a de Polignac number, because 110002202013 - 222 = 109998007709 is a prime.
It is a super-2 number, since 2×1100022020132 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110002202013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110002252013) 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 15 ways as a sum of consecutive naturals, for example, 16498648 + ... + 16505313.
It is an arithmetic number, because the mean of its divisors is an integer number (10099212372).
Almost surely, 2110002202013 is an apocalyptic number.
It is an amenable number.
110002202013 is a deficient number, since it is larger than the sum of its proper divisors (51585195939).
110002202013 is a wasteful number, since it uses less digits than its factorization.
110002202013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33004076.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 110002202013 its reverse (310202200011), we get a palindrome (420204402024).
The spelling of 110002202013 in words is "one hundred ten billion, two million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •