Base | Representation |
---|---|
bin | 11001101110001010000010… |
… | …001001101100101001100110 |
3 | 112211112110022121122112002122 |
4 | 121232022002021230221212 |
5 | 104311401432222103220 |
6 | 1040332000434505542 |
7 | 32553604123434425 |
oct | 3156120211545146 |
9 | 484473277575078 |
10 | 113123032222310 |
11 | 3305423263a540 |
12 | 108300027352b2 |
13 | 4b175c12725b6 |
14 | 1dd1280b732bc |
15 | d128ca218425 |
hex | 66e28226ca66 |
113123032222310 has 64 divisors (see below), whose sum is σ = 223325934686208. Its totient is φ = 40914700320000.
The previous prime is 113123032222301. The next prime is 113123032222349. The reversal of 113123032222310 is 13222230321311.
It is a super-2 number, since 2×1131230322223102 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 113123032222310.
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, 155341850 + ... + 156068370.
It is an arithmetic number, because the mean of its divisors is an integer number (3489467729472).
Almost surely, 2113123032222310 is an apocalyptic number.
113123032222310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113123032222310 is a deficient number, since it is larger than the sum of its proper divisors (110202902463898).
113123032222310 is a wasteful number, since it uses less digits than its factorization.
113123032222310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 734141.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 113123032222310 its reverse (13222230321311), we get a palindrome (126345262543621).
The spelling of 113123032222310 in words is "one hundred thirteen trillion, one hundred twenty-three billion, thirty-two million, two hundred twenty-two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •