Base | Representation |
---|---|
bin | 1101001000001000010001… |
… | …0001111000110110100111 |
3 | 1220002210220010222222112011 |
4 | 3102002010101320312213 |
5 | 3342433404201141031 |
6 | 50410323143135051 |
7 | 3016525601426314 |
oct | 322020421706647 |
9 | 56083803888464 |
10 | 14433309396391 |
11 | 466514a973556 |
12 | 1751332144487 |
13 | 8090944795a2 |
14 | 37c80c3bdd0b |
15 | 1a069bc2c6b1 |
hex | d2084478da7 |
14433309396391 has 2 divisors, whose sum is σ = 14433309396392. Its totient is φ = 14433309396390.
The previous prime is 14433309396371. The next prime is 14433309396433. The reversal of 14433309396391 is 19369390333441.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14433309396391 - 27 = 14433309396263 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14433309396361) 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, 7216654698195 + 7216654698196.
It is an arithmetic number, because the mean of its divisors is an integer number (7216654698196).
Almost surely, 214433309396391 is an apocalyptic number.
14433309396391 is a deficient number, since it is larger than the sum of its proper divisors (1).
14433309396391 is an equidigital number, since it uses as much as digits as its factorization.
14433309396391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17006112, while the sum is 58.
The spelling of 14433309396391 in words is "fourteen trillion, four hundred thirty-three billion, three hundred nine million, three hundred ninety-six thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •