Base | Representation |
---|---|
bin | 10010111011001010… |
… | …00111000011100101 |
3 | 222020001201121220212 |
4 | 21131211013003211 |
5 | 131301421201114 |
6 | 4400054505205 |
7 | 506526045503 |
oct | 113545070345 |
9 | 28201647825 |
10 | 10159943909 |
11 | 4344029265 |
12 | 1b76665205 |
13 | c5bb8b53b |
14 | 6c54b9673 |
15 | 3e6e53b3e |
hex | 25d9470e5 |
10159943909 has 2 divisors, whose sum is σ = 10159943910. Its totient is φ = 10159943908.
The previous prime is 10159943887. The next prime is 10159943921. The reversal of 10159943909 is 90934995101.
It is a happy number.
10159943909 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5596536100 + 4563407809 = 74810^2 + 67553^2 .
It is an emirp because it is prime and its reverse (90934995101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10159943909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10159943009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5079971954 + 5079971955.
It is an arithmetic number, because the mean of its divisors is an integer number (5079971955).
Almost surely, 210159943909 is an apocalyptic number.
It is an amenable number.
10159943909 is a deficient number, since it is larger than the sum of its proper divisors (1).
10159943909 is an equidigital number, since it uses as much as digits as its factorization.
10159943909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 393660, while the sum is 50.
The spelling of 10159943909 in words is "ten billion, one hundred fifty-nine million, nine hundred forty-three thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •