Base | Representation |
---|---|
bin | 110100001001111001… |
… | …1000100001100011011 |
3 | 101201002120012201102101 |
4 | 1220103303010030123 |
5 | 3313334313201243 |
6 | 123241440344231 |
7 | 11043332241010 |
oct | 1502363041433 |
9 | 351076181371 |
10 | 112001303323 |
11 | 435548a79a8 |
12 | 19859015077 |
13 | a73c00c560 |
14 | 55c6cdb707 |
15 | 2da7b6654d |
hex | 1a13cc431b |
112001303323 has 16 divisors (see below), whose sum is σ = 137897460736. Its totient is φ = 88584464160.
The previous prime is 112001303299. The next prime is 112001303353. The reversal of 112001303323 is 323303100211.
It is a cyclic number.
It is not a de Polignac number, because 112001303323 - 29 = 112001302811 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112001303323.
It is not an unprimeable number, because it can be changed into a prime (112001303353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33490 + ... + 474472.
It is an arithmetic number, because the mean of its divisors is an integer number (8618591296).
Almost surely, 2112001303323 is an apocalyptic number.
112001303323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
112001303323 is a deficient number, since it is larger than the sum of its proper divisors (25896157413).
112001303323 is a wasteful number, since it uses less digits than its factorization.
112001303323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443794.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 112001303323 its reverse (323303100211), we get a palindrome (435304403534).
The spelling of 112001303323 in words is "one hundred twelve billion, one million, three hundred three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •