Base | Representation |
---|---|
bin | 11001100010010101001000… |
… | …110010011011011101011010 |
3 | 112201122202120101002220100211 |
4 | 121202111020302123131122 |
5 | 104210043014134033310 |
6 | 1034510352120521334 |
7 | 32441103311154133 |
oct | 3142251062333532 |
9 | 481582511086324 |
10 | 112310321002330 |
11 | 328705a3311070 |
12 | 1071a5ab32024a |
13 | 4a88a829c40a9 |
14 | 1da3bc4574c8a |
15 | ceb6b1018c8a |
hex | 662548c9b75a |
112310321002330 has 32 divisors (see below), whose sum is σ = 220645430291520. Its totient is φ = 40819968587520.
The previous prime is 112310321002283. The next prime is 112310321002387. The reversal of 112310321002330 is 33200123013211.
It is a super-2 number, since 2×1123103210023302 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 251627775 + ... + 252073714.
It is an arithmetic number, because the mean of its divisors is an integer number (6895169696610).
Almost surely, 2112310321002330 is an apocalyptic number.
112310321002330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112310321002330 is a deficient number, since it is larger than the sum of its proper divisors (108335109289190).
112310321002330 is a wasteful number, since it uses less digits than its factorization.
112310321002330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 503703534.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 112310321002330 its reverse (33200123013211), we get a palindrome (145510444015541).
The spelling of 112310321002330 in words is "one hundred twelve trillion, three hundred ten billion, three hundred twenty-one million, two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •