Base | Representation |
---|---|
bin | 11001011101110110000101… |
… | …111111010000100000110110 |
3 | 112200120022000121222100120122 |
4 | 121131312011333100200312 |
5 | 104140020310143131410 |
6 | 1034113020432131542 |
7 | 32406612462033035 |
oct | 3135660577204066 |
9 | 480508017870518 |
10 | 112002110130230 |
11 | 32761912309061 |
12 | 1068a914096bb2 |
13 | 4a659a4a5c5a8 |
14 | 1d92d06b5671c |
15 | ce3672aa8e55 |
hex | 65dd85fd0836 |
112002110130230 has 16 divisors (see below), whose sum is σ = 201604166477280. Its totient is φ = 44800762220352.
The previous prime is 112002110130223. The next prime is 112002110130277. The reversal of 112002110130230 is 32031011200211.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 112002110130199 and 112002110130208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4317815 + ... + 15577154.
It is an arithmetic number, because the mean of its divisors is an integer number (12600260404830).
Almost surely, 2112002110130230 is an apocalyptic number.
112002110130230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112002110130230 is a deficient number, since it is larger than the sum of its proper divisors (89602056347050).
112002110130230 is a wasteful number, since it uses less digits than its factorization.
112002110130230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20457943.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 112002110130230 its reverse (32031011200211), we get a palindrome (144033121330441).
The spelling of 112002110130230 in words is "one hundred twelve trillion, two billion, one hundred ten million, one hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •