Base | Representation |
---|---|
bin | 1101000011010100100101… |
… | …0101001101000000100001 |
3 | 1212210220201002000022000111 |
4 | 3100311021111031000201 |
5 | 3340110231300443014 |
6 | 50304343344451321 |
7 | 3010543056415561 |
oct | 320651125150041 |
9 | 55726632008014 |
10 | 14350716031009 |
11 | 46331170936a6 |
12 | 1739321919b41 |
13 | 801360c85657 |
14 | 37881504cda1 |
15 | 19d465c3e2c4 |
hex | d0d4954d021 |
14350716031009 has 2 divisors, whose sum is σ = 14350716031010. Its totient is φ = 14350716031008.
The previous prime is 14350716030983. The next prime is 14350716031019. The reversal of 14350716031009 is 90013061705341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13955417133025 + 395298897984 = 3735695^2 + 628728^2 .
It is a cyclic number.
It is not a de Polignac number, because 14350716031009 - 27 = 14350716030881 is a prime.
It is not a weakly prime, because it can be changed into another prime (14350716031019) 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, 7175358015504 + 7175358015505.
It is an arithmetic number, because the mean of its divisors is an integer number (7175358015505).
Almost surely, 214350716031009 is an apocalyptic number.
It is an amenable number.
14350716031009 is a deficient number, since it is larger than the sum of its proper divisors (1).
14350716031009 is an equidigital number, since it uses as much as digits as its factorization.
14350716031009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 40.
The spelling of 14350716031009 in words is "fourteen trillion, three hundred fifty billion, seven hundred sixteen million, thirty-one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •