Base | Representation |
---|---|
bin | 110011001110010100… |
… | …1001101101010101111 |
3 | 101111221020121101002010 |
4 | 1212130221031222233 |
5 | 3300241032410413 |
6 | 122311225332303 |
7 | 10642646354460 |
oct | 1463451155257 |
9 | 344836541063 |
10 | 110002231983 |
11 | 42719435026 |
12 | 1939b637093 |
13 | a4b0acbac7 |
14 | 5477604d67 |
15 | 2cdc3d8dc3 |
hex | 199ca4daaf |
110002231983 has 64 divisors (see below), whose sum is σ = 179940787200. Its totient is φ = 58372254720.
The previous prime is 110002231961. The next prime is 110002232009. The reversal of 110002231983 is 389132200011.
It is not a de Polignac number, because 110002231983 - 210 = 110002230959 is a prime.
It is a super-2 number, since 2×1100022319832 (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 110002231983.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110002235983) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 34277683 + ... + 34280891.
It is an arithmetic number, because the mean of its divisors is an integer number (2811574800).
Almost surely, 2110002231983 is an apocalyptic number.
110002231983 is a deficient number, since it is larger than the sum of its proper divisors (69938555217).
110002231983 is a wasteful number, since it uses less digits than its factorization.
110002231983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4912.
The product of its (nonzero) digits is 2592, while the sum is 30.
Adding to 110002231983 its reverse (389132200011), we get a palindrome (499134431994).
The spelling of 110002231983 in words is "one hundred ten billion, two million, two hundred thirty-one thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •