Base | Representation |
---|---|
bin | 10010110101011101… |
… | …01001001001100011 |
3 | 222002201201110210011 |
4 | 21122232221021203 |
5 | 131202200024303 |
6 | 4351225345351 |
7 | 505405345525 |
oct | 113256511143 |
9 | 28081643704 |
10 | 10112111203 |
11 | 431a0288a7 |
12 | 1b62638257 |
13 | c51cb176c |
14 | 6bcdc7a15 |
15 | 3e2b5616d |
hex | 25aba9263 |
10112111203 has 8 divisors (see below), whose sum is σ = 10418673600. Its totient is φ = 9809836608.
The previous prime is 10112111189. The next prime is 10112111237. The reversal of 10112111203 is 30211121101.
It is a happy number.
10112111203 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
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 10112111203 - 29 = 10112110691 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10112111903) 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 7 ways as a sum of consecutive naturals, for example, 1067163 + ... + 1076596.
It is an arithmetic number, because the mean of its divisors is an integer number (1302334200).
Almost surely, 210112111203 is an apocalyptic number.
10112111203 is a deficient number, since it is larger than the sum of its proper divisors (306562397).
10112111203 is an equidigital number, since it uses as much as digits as its factorization.
10112111203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2143901.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 10112111203 its reverse (30211121101), we get a palindrome (40323232304).
The spelling of 10112111203 in words is "ten billion, one hundred twelve million, one hundred eleven thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •