Base | Representation |
---|---|
bin | 110100010010111000… |
… | …1111111000110100101 |
3 | 101201212120221000110122 |
4 | 1220211301333012211 |
5 | 3314444032311323 |
6 | 123331415131325 |
7 | 11053654556642 |
oct | 1504561770645 |
9 | 351776830418 |
10 | 112303010213 |
11 | 4369a137839 |
12 | 19922073b45 |
13 | a789687244 |
14 | 5614dd6dc9 |
15 | 2dc43b0ec8 |
hex | 1a25c7f1a5 |
112303010213 has 8 divisors (see below), whose sum is σ = 114574334976. Its totient is φ = 110037330000.
The previous prime is 112303010153. The next prime is 112303010227. The reversal of 112303010213 is 312010303211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112303010213 - 28 = 112303009957 is a prime.
It is a super-2 number, since 2×1123030102132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112303010191 and 112303010200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112303010233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1370933 + ... + 1450538.
It is an arithmetic number, because the mean of its divisors is an integer number (14321791872).
Almost surely, 2112303010213 is an apocalyptic number.
It is an amenable number.
112303010213 is a deficient number, since it is larger than the sum of its proper divisors (2271324763).
112303010213 is an equidigital number, since it uses as much as digits as its factorization.
112303010213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2822275.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 112303010213 its reverse (312010303211), we get a palindrome (424313313424).
The spelling of 112303010213 in words is "one hundred twelve billion, three hundred three million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •