Base | Representation |
---|---|
bin | 11001111100101001… |
… | …00011110110011001 |
3 | 1022221211122122200201 |
4 | 30332110203312121 |
5 | 212012200312001 |
6 | 10222150302201 |
7 | 1002132055255 |
oct | 147624436631 |
9 | 38854578621 |
10 | 13930479001 |
11 | 59a943506a |
12 | 2849357961 |
13 | 14100aa3aa |
14 | 96217b265 |
15 | 567e9e501 |
hex | 33e523d99 |
13930479001 has 2 divisors, whose sum is σ = 13930479002. Its totient is φ = 13930479000.
The previous prime is 13930478987. The next prime is 13930479011. The reversal of 13930479001 is 10097403931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13543373376 + 387105625 = 116376^2 + 19675^2 .
It is a cyclic number.
It is not a de Polignac number, because 13930479001 - 213 = 13930470809 is a prime.
It is not a weakly prime, because it can be changed into another prime (13930479011) 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, 6965239500 + 6965239501.
It is an arithmetic number, because the mean of its divisors is an integer number (6965239501).
Almost surely, 213930479001 is an apocalyptic number.
It is an amenable number.
13930479001 is a deficient number, since it is larger than the sum of its proper divisors (1).
13930479001 is an equidigital number, since it uses as much as digits as its factorization.
13930479001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20412, while the sum is 37.
The spelling of 13930479001 in words is "thirteen billion, nine hundred thirty million, four hundred seventy-nine thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •