Base | Representation |
---|---|
bin | 111100001100111… |
… | …011011011010111 |
3 | 2121101112102212001 |
4 | 330030323123113 |
5 | 4032031201403 |
6 | 244120140131 |
7 | 34013021566 |
oct | 7414733327 |
9 | 2541472761 |
10 | 1010022103 |
11 | 479149612 |
12 | 242307647 |
13 | 131338b1c |
14 | 981d9bdd |
15 | 5da10c1d |
hex | 3c33b6d7 |
1010022103 has 8 divisors (see below), whose sum is σ = 1032737328. Its totient is φ = 987558144.
The previous prime is 1010022089. The next prime is 1010022127. The reversal of 1010022103 is 3012200101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010022103 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 1010022103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010022163) 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, 54676 + ... + 70777.
It is an arithmetic number, because the mean of its divisors is an integer number (129092166).
Almost surely, 21010022103 is an apocalyptic number.
1010022103 is a deficient number, since it is larger than the sum of its proper divisors (22715225).
1010022103 is an equidigital number, since it uses as much as digits as its factorization.
1010022103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125633.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 1010022103 is about 31780.8449069561. The cubic root of 1010022103 is about 1003.3296024433.
Adding to 1010022103 its reverse (3012200101), we get a palindrome (4022222204).
The spelling of 1010022103 in words is "one billion, ten million, twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •