Base | Representation |
---|---|
bin | 11000011010000110… |
… | …10001001110111101 |
3 | 1020211020020012022210 |
4 | 30031003101032331 |
5 | 203314042101332 |
6 | 10004141131033 |
7 | 642503665251 |
oct | 141503211675 |
9 | 36736205283 |
10 | 13103862717 |
11 | 5614875010 |
12 | 2658559a79 |
13 | 130aa6872a |
14 | 8c4484261 |
15 | 51a61aecc |
hex | 30d0d13bd |
13103862717 has 8 divisors (see below), whose sum is σ = 19060164000. Its totient is φ = 7941734960.
The previous prime is 13103862697. The next prime is 13103862809. The reversal of 13103862717 is 71726830131.
13103862717 is digitally balanced in base 2, 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 13103862717 - 28 = 13103862461 is a prime.
It is a super-2 number, since 2×131038627172 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13103861717) 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, 198543342 + ... + 198543407.
It is an arithmetic number, because the mean of its divisors is an integer number (2382520500).
Almost surely, 213103862717 is an apocalyptic number.
It is an amenable number.
13103862717 is a deficient number, since it is larger than the sum of its proper divisors (5956301283).
13103862717 is a wasteful number, since it uses less digits than its factorization.
13103862717 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397086763.
The product of its (nonzero) digits is 42336, while the sum is 39.
The spelling of 13103862717 in words is "thirteen billion, one hundred three million, eight hundred sixty-two thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.204 sec. • engine limits •