Base | Representation |
---|---|
bin | 101111111101111100… |
… | …0011110010101000111 |
3 | 100211212221201221212221 |
4 | 1133323320132111013 |
5 | 3141431043231234 |
6 | 115153332353211 |
7 | 10304454454252 |
oct | 1377370362507 |
9 | 324787657787 |
10 | 103010133319 |
11 | 3a760597895 |
12 | 17b69a75807 |
13 | 9938331412 |
14 | 4db2b44099 |
15 | 2a2d630eb4 |
hex | 17fbe1e547 |
103010133319 has 4 divisors (see below), whose sum is σ = 109069552944. Its totient is φ = 96950713696.
The previous prime is 103010133287. The next prime is 103010133329. The reversal of 103010133319 is 913331010301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 913331010301 = 29 ⋅31494172769.
It is a cyclic number.
It is not a de Polignac number, because 103010133319 - 25 = 103010133287 is a prime.
It is a super-2 number, since 2×1030101333192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103010133293 and 103010133302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103010133329) 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, 3029709787 + ... + 3029709820.
It is an arithmetic number, because the mean of its divisors is an integer number (27267388236).
Almost surely, 2103010133319 is an apocalyptic number.
103010133319 is a deficient number, since it is larger than the sum of its proper divisors (6059419625).
103010133319 is an equidigital number, since it uses as much as digits as its factorization.
103010133319 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6059419624.
The product of its (nonzero) digits is 729, while the sum is 25.
The spelling of 103010133319 in words is "one hundred three billion, ten million, one hundred thirty-three thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •