Base | Representation |
---|---|
bin | 101111111101111100… |
… | …0110110000000011101 |
3 | 100211212221220212220212 |
4 | 1133323320312000131 |
5 | 3141431104332201 |
6 | 115153334422205 |
7 | 10304455340066 |
oct | 1377370660035 |
9 | 324787825825 |
10 | 103010230301 |
11 | 3a760653740 |
12 | 17b69b01965 |
13 | 99383665c4 |
14 | 4db2b6b56d |
15 | 2a2d64eabb |
hex | 17fbe3601d |
103010230301 has 8 divisors (see below), whose sum is σ = 112385060064. Its totient is φ = 93637111120.
The previous prime is 103010230283. The next prime is 103010230307. The reversal of 103010230301 is 103032010301.
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 103010230301 - 230 = 101936488477 is a prime.
It is a super-2 number, since 2×1030102303012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103010230307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 300071 + ... + 544116.
It is an arithmetic number, because the mean of its divisors is an integer number (14048132508).
Almost surely, 2103010230301 is an apocalyptic number.
103010230301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103010230301 is a deficient number, since it is larger than the sum of its proper divisors (9374829763).
103010230301 is a wasteful number, since it uses less digits than its factorization.
103010230301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 855291.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 103010230301 its reverse (103032010301), we get a palindrome (206042240602).
The spelling of 103010230301 in words is "one hundred three billion, ten million, two hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •