Base | Representation |
---|---|
bin | 11001111101011010… |
… | …01111111010101111 |
3 | 1022222021211110112212 |
4 | 30332231033322233 |
5 | 212020324412314 |
6 | 10222541121035 |
7 | 1002241062041 |
oct | 147655177257 |
9 | 38867743485 |
10 | 13936950959 |
11 | 5a02055598 |
12 | 284b55917b |
13 | 1411535159 |
14 | 962d83a91 |
15 | 56882be3e |
hex | 33eb4feaf |
13936950959 has 2 divisors, whose sum is σ = 13936950960. Its totient is φ = 13936950958.
The previous prime is 13936950869. The next prime is 13936950961. The reversal of 13936950959 is 95905963931.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13936950959 is a prime.
It is a Sophie Germain prime.
Together with 13936950961, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 13936950898 and 13936950907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13936953959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6968475479 + 6968475480.
It is an arithmetic number, because the mean of its divisors is an integer number (6968475480).
Almost surely, 213936950959 is an apocalyptic number.
13936950959 is a deficient number, since it is larger than the sum of its proper divisors (1).
13936950959 is an equidigital number, since it uses as much as digits as its factorization.
13936950959 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8857350, while the sum is 59.
The spelling of 13936950959 in words is "thirteen billion, nine hundred thirty-six million, nine hundred fifty thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •