Base | Representation |
---|---|
bin | 11001000101011001100100… |
… | …111010110110000000100110 |
3 | 112110121200221102011212202221 |
4 | 121011121210322312000212 |
5 | 103430004403104042410 |
6 | 1030345155111222554 |
7 | 32144342351005663 |
oct | 3105314472660046 |
9 | 473550842155687 |
10 | 110322223112230 |
11 | 32174434941648 |
12 | 10459229377a5a |
13 | 497345823c1cc |
14 | 1d358a4700a6a |
15 | cb4b02dc24da |
hex | 645664eb6026 |
110322223112230 has 32 divisors (see below), whose sum is σ = 198661201344000. Its totient is φ = 44110846019040.
The previous prime is 110322223112203. The next prime is 110322223112251. The reversal of 110322223112230 is 32211322223011.
It is a junction number, because it is equal to n+sod(n) for n = 110322223112195 and 110322223112204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1081677297 + ... + 1081779283.
It is an arithmetic number, because the mean of its divisors is an integer number (6208162542000).
Almost surely, 2110322223112230 is an apocalyptic number.
110322223112230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110322223112230 is a deficient number, since it is larger than the sum of its proper divisors (88338978231770).
110322223112230 is a wasteful number, since it uses less digits than its factorization.
110322223112230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145164.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 110322223112230 its reverse (32211322223011), we get a palindrome (142533545335241).
The spelling of 110322223112230 in words is "one hundred ten trillion, three hundred twenty-two billion, two hundred twenty-three million, one hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •