Base | Representation |
---|---|
bin | 101111111101101001… |
… | …1011101010110111101 |
3 | 100211212021110222110020 |
4 | 1133323103131112331 |
5 | 3141421102230023 |
6 | 115152344402353 |
7 | 10304306131605 |
oct | 1377323352675 |
9 | 324767428406 |
10 | 103000430013 |
11 | 3a75606a628 |
12 | 17b667763b9 |
13 | 9936314910 |
14 | 4db1739c05 |
15 | 2a2c865de3 |
hex | 17fb4dd5bd |
103000430013 has 32 divisors (see below), whose sum is σ = 148577452800. Its totient is φ = 63094187520.
The previous prime is 103000429981. The next prime is 103000430033. The reversal of 103000430013 is 310034000301.
It is not a de Polignac number, because 103000430013 - 25 = 103000429981 is a prime.
It is a super-2 number, since 2×1030004300132 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 103000429974 and 103000430001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103000430033) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11973888 + ... + 11982486.
It is an arithmetic number, because the mean of its divisors is an integer number (4643045400).
Almost surely, 2103000430013 is an apocalyptic number.
103000430013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
103000430013 is a deficient number, since it is larger than the sum of its proper divisors (45577022787).
103000430013 is a wasteful number, since it uses less digits than its factorization.
103000430013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9989.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 103000430013 its reverse (310034000301), we get a palindrome (413034430314).
The spelling of 103000430013 in words is "one hundred three billion, four hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •