Base | Representation |
---|---|
bin | 110011010101100000… |
… | …0100011001000010110 |
3 | 101112120001002100112010 |
4 | 1212223000203020112 |
5 | 3301234231331410 |
6 | 122351155005050 |
7 | 10651633665330 |
oct | 1465300431026 |
9 | 345501070463 |
10 | 110243230230 |
11 | 4283247a631 |
12 | 19448299786 |
13 | a51ba0c113 |
14 | 549b61a450 |
15 | 2d03640c20 |
hex | 19ab023216 |
110243230230 has 64 divisors (see below), whose sum is σ = 302467115520. Its totient is φ = 25191312384.
The previous prime is 110243230177. The next prime is 110243230247. The reversal of 110243230230 is 32032342011.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110243230197 and 110243230206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 687001 + ... + 832139.
It is an arithmetic number, because the mean of its divisors is an integer number (4726048680).
Almost surely, 2110243230230 is an apocalyptic number.
110243230230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110243230230 is an abundant number, since it is smaller than the sum of its proper divisors (192223885290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110243230230 is a wasteful number, since it uses less digits than its factorization.
110243230230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148773.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 110243230230 its reverse (32032342011), we get a palindrome (142275572241).
The spelling of 110243230230 in words is "one hundred ten billion, two hundred forty-three million, two hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •