Base | Representation |
---|---|
bin | 111100011000010… |
… | …100111010110111 |
3 | 2121121011020121201 |
4 | 330120110322313 |
5 | 4033312310403 |
6 | 244304153331 |
7 | 34050305140 |
oct | 7430247267 |
9 | 2547136551 |
10 | 1013010103 |
11 | 47a8aa536 |
12 | 243308847 |
13 | 131b43b81 |
14 | 98776ac7 |
15 | 5de0121d |
hex | 3c614eb7 |
1013010103 has 32 divisors (see below), whose sum is σ = 1206922752. Its totient is φ = 832464000.
The previous prime is 1013010079. The next prime is 1013010133. The reversal of 1013010103 is 3010103101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1013010103 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1013010103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013010133) 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 31 ways as a sum of consecutive naturals, for example, 3579400 + ... + 3579682.
It is an arithmetic number, because the mean of its divisors is an integer number (37716336).
Almost surely, 21013010103 is an apocalyptic number.
1013010103 is a deficient number, since it is larger than the sum of its proper divisors (193912649).
1013010103 is a wasteful number, since it uses less digits than its factorization.
1013010103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 535.
The product of its (nonzero) digits is 9, while the sum is 10.
The square root of 1013010103 is about 31827.8196394286. The cubic root of 1013010103 is about 1004.3180287903.
Adding to 1013010103 its reverse (3010103101), we get a palindrome (4023113204).
It can be divided in two parts, 101 and 3010103, that multiplied together give a palindrome (304020403).
The spelling of 1013010103 in words is "one billion, thirteen million, ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •