Base | Representation |
---|---|
bin | 11001011110010011001001… |
… | …110101001001110101101010 |
3 | 112200200021120012212121122120 |
4 | 121132103021311021311222 |
5 | 104141023211123300320 |
6 | 1034135221000132110 |
7 | 32412065636651532 |
oct | 3136231165116552 |
9 | 480607505777576 |
10 | 112033313103210 |
11 | 327740745a9534 |
12 | 10694981a67036 |
13 | 4a6890841a105 |
14 | 1d94626c664c2 |
15 | ce439c109440 |
hex | 65e4c9d49d6a |
112033313103210 has 16 divisors (see below), whose sum is σ = 268879951447776. Its totient is φ = 29875550160848.
The previous prime is 112033313103169. The next prime is 112033313103223. The reversal of 112033313103210 is 12301313330211.
It is a super-3 number, since 3×1120333131032103 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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, 1867221885024 + ... + 1867221885083.
It is an arithmetic number, because the mean of its divisors is an integer number (16804996965486).
Almost surely, 2112033313103210 is an apocalyptic number.
112033313103210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112033313103210 is an abundant number, since it is smaller than the sum of its proper divisors (156846638344566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112033313103210 is a wasteful number, since it uses less digits than its factorization.
112033313103210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3734443770117.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 112033313103210 its reverse (12301313330211), we get a palindrome (124334626433421).
The spelling of 112033313103210 in words is "one hundred twelve trillion, thirty-three billion, three hundred thirteen million, one hundred three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •