Base | Representation |
---|---|
bin | 11010101100011001… |
… | …11011101000110101 |
3 | 1100222202112221221001 |
4 | 31112030323220311 |
5 | 213322232214334 |
6 | 10330021523301 |
7 | 1015065421213 |
oct | 152614735065 |
9 | 40882487831 |
10 | 14331132469 |
11 | 6094606a35 |
12 | 293b573531 |
13 | 14750ba254 |
14 | 99d471cb3 |
15 | 58d241714 |
hex | 35633ba35 |
14331132469 has 2 divisors, whose sum is σ = 14331132470. Its totient is φ = 14331132468.
The previous prime is 14331132457. The next prime is 14331132521. The reversal of 14331132469 is 96423113341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11797218225 + 2533914244 = 108615^2 + 50338^2 .
It is a cyclic number.
It is not a de Polignac number, because 14331132469 - 27 = 14331132341 is a prime.
It is a super-2 number, since 2×143311324692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14331133469) 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, 7165566234 + 7165566235.
It is an arithmetic number, because the mean of its divisors is an integer number (7165566235).
Almost surely, 214331132469 is an apocalyptic number.
It is an amenable number.
14331132469 is a deficient number, since it is larger than the sum of its proper divisors (1).
14331132469 is an equidigital number, since it uses as much as digits as its factorization.
14331132469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 46656, while the sum is 37.
The spelling of 14331132469 in words is "fourteen billion, three hundred thirty-one million, one hundred thirty-two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •