Base | Representation |
---|---|
bin | 111001011101111010… |
… | …0001100110000010001 |
3 | 102210112122220000102212 |
4 | 1302323310030300101 |
5 | 4010220441414114 |
6 | 132405510521505 |
7 | 11626134414341 |
oct | 1627364146021 |
9 | 383478800385 |
10 | 123410107409 |
11 | 48379874306 |
12 | 1bb01966295 |
13 | b83983b8c4 |
14 | 5d8a1c4d21 |
15 | 3324557b3e |
hex | 1cbbd0cc11 |
123410107409 has 4 divisors (see below), whose sum is σ = 129905376240. Its totient is φ = 116914838580.
The previous prime is 123410107391. The next prime is 123410107423. The reversal of 123410107409 is 904701014321.
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 123410107409 - 28 = 123410107153 is a prime.
It is a super-2 number, since 2×1234101074092 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123410103409) 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, 3247634387 + ... + 3247634424.
It is an arithmetic number, because the mean of its divisors is an integer number (32476344060).
Almost surely, 2123410107409 is an apocalyptic number.
123410107409 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
123410107409 is a deficient number, since it is larger than the sum of its proper divisors (6495268831).
123410107409 is an equidigital number, since it uses as much as digits as its factorization.
123410107409 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6495268830.
The product of its (nonzero) digits is 6048, while the sum is 32.
The spelling of 123410107409 in words is "one hundred twenty-three billion, four hundred ten million, one hundred seven thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •