Base | Representation |
---|---|
bin | 11011000100101101… |
… | …01011010000010001 |
3 | 1101111222012011222101 |
4 | 31202112223100101 |
5 | 214231430412033 |
6 | 10402143440401 |
7 | 1023122401225 |
oct | 154226532021 |
9 | 41458164871 |
10 | 14535013393 |
11 | 61896aa76a |
12 | 29978b6101 |
13 | 14a8402b54 |
14 | 9bc584785 |
15 | 5a10b597d |
hex | 3625ab411 |
14535013393 has 2 divisors, whose sum is σ = 14535013394. Its totient is φ = 14535013392.
The previous prime is 14535013333. The next prime is 14535013439. The reversal of 14535013393 is 39331053541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10430945424 + 4104067969 = 102132^2 + 64063^2 .
It is a cyclic number.
It is not a de Polignac number, because 14535013393 - 229 = 13998142481 is a prime.
It is a super-2 number, since 2×145350133932 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14535013333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7267506696 + 7267506697.
It is an arithmetic number, because the mean of its divisors is an integer number (7267506697).
Almost surely, 214535013393 is an apocalyptic number.
It is an amenable number.
14535013393 is a deficient number, since it is larger than the sum of its proper divisors (1).
14535013393 is an equidigital number, since it uses as much as digits as its factorization.
14535013393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72900, while the sum is 37.
The spelling of 14535013393 in words is "fourteen billion, five hundred thirty-five million, thirteen thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •