Base | Representation |
---|---|
bin | 111100011000010… |
… | …010011101001101 |
3 | 2121121010201210000 |
4 | 330120102131031 |
5 | 4033312000023 |
6 | 244304034513 |
7 | 34050233544 |
oct | 7430223515 |
9 | 2547121700 |
10 | 1013000013 |
11 | 47a8a29a3 |
12 | 243302a39 |
13 | 131b3c3bc |
14 | 9877315b |
15 | 5dded243 |
hex | 3c61274d |
1013000013 has 20 divisors (see below), whose sum is σ = 1517858848. Its totient is φ = 673275240.
The previous prime is 1013000011. The next prime is 1013000033. The reversal of 1013000013 is 3100003101.
1013000013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1013000013 - 21 = 1013000011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1012999959 and 1013000004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013000011) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 7920 + ... + 45702.
Almost surely, 21013000013 is an apocalyptic number.
It is an amenable number.
1013000013 is a deficient number, since it is larger than the sum of its proper divisors (504858835).
1013000013 is an equidigital number, since it uses as much as digits as its factorization.
1013000013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38126 (or 38117 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
The square root of 1013000013 is about 31827.6611299040. The cubic root of 1013000013 is about 1004.3146943048.
Adding to 1013000013 its reverse (3100003101), we get a palindrome (4113003114).
The spelling of 1013000013 in words is "one billion, thirteen million, thirteen", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •