Base | Representation |
---|---|
bin | 110000001001110111… |
… | …0010100010110111101 |
3 | 100212220211101121020210 |
4 | 1200103232110112331 |
5 | 3143240442433341 |
6 | 115301141503033 |
7 | 10320412360425 |
oct | 1402356242675 |
9 | 325824347223 |
10 | 103410124221 |
11 | 3a946356988 |
12 | 1805ba11a79 |
13 | 99a016b821 |
14 | 500dd05485 |
15 | 2a537e1c16 |
hex | 1813b945bd |
103410124221 has 4 divisors (see below), whose sum is σ = 137880165632. Its totient is φ = 68940082812.
The previous prime is 103410124219. The next prime is 103410124231. The reversal of 103410124221 is 122421014301.
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 not a de Polignac number, because 103410124221 - 21 = 103410124219 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103410124231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17235020701 + ... + 17235020706.
It is an arithmetic number, because the mean of its divisors is an integer number (34470041408).
Almost surely, 2103410124221 is an apocalyptic number.
It is an amenable number.
103410124221 is a deficient number, since it is larger than the sum of its proper divisors (34470041411).
103410124221 is an equidigital number, since it uses as much as digits as its factorization.
103410124221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34470041410.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 103410124221 its reverse (122421014301), we get a palindrome (225831138522).
The spelling of 103410124221 in words is "one hundred three billion, four hundred ten million, one hundred twenty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •