Base | Representation |
---|---|
bin | 10010110101011101… |
… | …00111001001011011 |
3 | 222002201201001112110 |
4 | 21122232213021123 |
5 | 131202144244003 |
6 | 4351225243403 |
7 | 505405312602 |
oct | 113256471133 |
9 | 28081631473 |
10 | 10112103003 |
11 | 431a022722 |
12 | 1b62633563 |
13 | c51caab02 |
14 | 6bcdc4a39 |
15 | 3e2b53a03 |
hex | 25aba725b |
10112103003 has 8 divisors (see below), whose sum is σ = 13947728400. Its totient is φ = 6508939808.
The previous prime is 10112102989. The next prime is 10112103011. The reversal of 10112103003 is 30030121101.
10112103003 is digitally balanced in base 3, because in such base 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 10112103003 - 218 = 10111840859 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10112103003.
It is not an unprimeable number, because it can be changed into a prime (10112103073) 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, 58115448 + ... + 58115621.
It is an arithmetic number, because the mean of its divisors is an integer number (1743466050).
Almost surely, 210112103003 is an apocalyptic number.
10112103003 is a deficient number, since it is larger than the sum of its proper divisors (3835625397).
10112103003 is a wasteful number, since it uses less digits than its factorization.
10112103003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116231101.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 10112103003 its reverse (30030121101), we get a palindrome (40142224104).
The spelling of 10112103003 in words is "ten billion, one hundred twelve million, one hundred three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •