Base | Representation |
---|---|
bin | 110000000110100101… |
… | …1110000101101011101 |
3 | 100212122011221010200022 |
4 | 1200031023300231131 |
5 | 3143024400331023 |
6 | 115242222041525 |
7 | 10314610633544 |
oct | 1401513605535 |
9 | 325564833608 |
10 | 103300402013 |
11 | 3a89a424a76 |
12 | 1802b1192a5 |
13 | 9983502a43 |
14 | 4ddd50315b |
15 | 2a48d6b7c8 |
hex | 180d2f0b5d |
103300402013 has 4 divisors (see below), whose sum is σ = 103301514528. Its totient is φ = 103299289500.
The previous prime is 103300401979. The next prime is 103300402039. The reversal of 103300402013 is 310204003301.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 103300402013 - 218 = 103300139869 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103300401982 and 103300402000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103300402213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 402881 + ... + 607382.
It is an arithmetic number, because the mean of its divisors is an integer number (25825378632).
Almost surely, 2103300402013 is an apocalyptic number.
It is an amenable number.
103300402013 is a deficient number, since it is larger than the sum of its proper divisors (1112515).
103300402013 is a wasteful number, since it uses less digits than its factorization.
103300402013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1112514.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 103300402013 its reverse (310204003301), we get a palindrome (413504405314).
The spelling of 103300402013 in words is "one hundred three billion, three hundred million, four hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •