Base | Representation |
---|---|
bin | 110100001010110000… |
… | …1101110101011110001 |
3 | 101201011120210120111022 |
4 | 1220111201232223301 |
5 | 3313414230010301 |
6 | 123244354225225 |
7 | 11044133643632 |
oct | 1502541565361 |
9 | 351146716438 |
10 | 112030313201 |
11 | 4356a211504 |
12 | 19866885215 |
13 | a745028971 |
14 | 55caacd889 |
15 | 2daa496d1b |
hex | 1a1586eaf1 |
112030313201 has 8 divisors (see below), whose sum is σ = 115649581824. Its totient is φ = 108411381360.
The previous prime is 112030313189. The next prime is 112030313207. The reversal of 112030313201 is 102313030211.
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 112030313201 - 230 = 110956571377 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112030313201.
It is not an unprimeable number, because it can be changed into a prime (112030313207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 711290 + ... + 854396.
It is an arithmetic number, because the mean of its divisors is an integer number (14456197728).
Almost surely, 2112030313201 is an apocalyptic number.
It is an amenable number.
112030313201 is a deficient number, since it is larger than the sum of its proper divisors (3619268623).
112030313201 is a wasteful number, since it uses less digits than its factorization.
112030313201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168391.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 112030313201 its reverse (102313030211), we get a palindrome (214343343412).
The spelling of 112030313201 in words is "one hundred twelve billion, thirty million, three hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •