Base | Representation |
---|---|
bin | 110100001001111001… |
… | …0101010111111100111 |
3 | 101201002120000110211102 |
4 | 1220103302222333213 |
5 | 3313334301400403 |
6 | 123241434230315 |
7 | 11043331331042 |
oct | 1502362527747 |
9 | 351076013742 |
10 | 112001200103 |
11 | 435548373a1 |
12 | 19858b8539b |
13 | a73bca4590 |
14 | 55c6cb1c59 |
15 | 2da7b45b88 |
hex | 1a13caafe7 |
112001200103 has 4 divisors (see below), whose sum is σ = 120616677048. Its totient is φ = 103385723160.
The previous prime is 112001200097. The next prime is 112001200151. The reversal of 112001200103 is 301002100211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301002100211 = 1879 ⋅160192709.
It is a cyclic number.
It is not a de Polignac number, because 112001200103 - 28 = 112001199847 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112001200153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4307738453 + ... + 4307738478.
It is an arithmetic number, because the mean of its divisors is an integer number (30154169262).
Almost surely, 2112001200103 is an apocalyptic number.
112001200103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
112001200103 is a deficient number, since it is larger than the sum of its proper divisors (8615476945).
112001200103 is an equidigital number, since it uses as much as digits as its factorization.
112001200103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8615476944.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 112001200103 its reverse (301002100211), we get a palindrome (413003300314).
The spelling of 112001200103 in words is "one hundred twelve billion, one million, two hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •