Base | Representation |
---|---|
bin | 1001001100011110001110… |
… | …0111101111011100011101 |
3 | 1022210111100200222202210022 |
4 | 2103013203213233130131 |
5 | 2311120011441042334 |
6 | 33300225140121525 |
7 | 2062262113464503 |
oct | 223074347573435 |
9 | 38714320882708 |
10 | 10109876893469 |
11 | 3248635a403a1 |
12 | 11734413962a5 |
13 | 584484cb1512 |
14 | 26d46bc28673 |
15 | 127eab31e82e |
hex | 931e39ef71d |
10109876893469 has 2 divisors, whose sum is σ = 10109876893470. Its totient is φ = 10109876893468.
The previous prime is 10109876893463. The next prime is 10109876893471. The reversal of 10109876893469 is 96439867890101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9186730645444 + 923146248025 = 3030962^2 + 960805^2 .
It is a cyclic number.
It is not a de Polignac number, because 10109876893469 - 24 = 10109876893453 is a prime.
It is a super-2 number, since 2×101098768934692 (a number of 27 digits) contains 22 as substring.
Together with 10109876893471, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10109876893463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5054938446734 + 5054938446735.
It is an arithmetic number, because the mean of its divisors is an integer number (5054938446735).
Almost surely, 210109876893469 is an apocalyptic number.
It is an amenable number.
10109876893469 is a deficient number, since it is larger than the sum of its proper divisors (1).
10109876893469 is an equidigital number, since it uses as much as digits as its factorization.
10109876893469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 141087744, while the sum is 71.
The spelling of 10109876893469 in words is "ten trillion, one hundred nine billion, eight hundred seventy-six million, eight hundred ninety-three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •