Base | Representation |
---|---|
bin | 10010111111010010… |
… | …10111000101011001 |
3 | 222022110221222101022 |
4 | 21133221113011121 |
5 | 131334310100234 |
6 | 4403333532225 |
7 | 510426530351 |
oct | 113751270531 |
9 | 28273858338 |
10 | 10194612569 |
11 | 4361658349 |
12 | 1b861a4075 |
13 | c6610953b |
14 | 6c9d41b61 |
15 | 3ea000e2e |
hex | 25fa57159 |
10194612569 has 2 divisors, whose sum is σ = 10194612570. Its totient is φ = 10194612568.
The previous prime is 10194612517. The next prime is 10194612613. The reversal of 10194612569 is 96521649101.
It is an a-pointer prime, because the next prime (10194612613) can be obtained adding 10194612569 to its sum of digits (44).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10167697225 + 26915344 = 100835^2 + 5188^2 .
It is a cyclic number.
It is not a de Polignac number, because 10194612569 - 28 = 10194612313 is a prime.
It is a super-2 number, since 2×101946125692 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10194612269) 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 as a sum of consecutive naturals, namely, 5097306284 + 5097306285.
It is an arithmetic number, because the mean of its divisors is an integer number (5097306285).
Almost surely, 210194612569 is an apocalyptic number.
It is an amenable number.
10194612569 is a deficient number, since it is larger than the sum of its proper divisors (1).
10194612569 is an equidigital number, since it uses as much as digits as its factorization.
10194612569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 44.
The spelling of 10194612569 in words is "ten billion, one hundred ninety-four million, six hundred twelve thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •