Base | Representation |
---|---|
bin | 11010010100011100… |
… | …10000000000001001 |
3 | 1100110202101001202222 |
4 | 31022032100000021 |
5 | 212414304321213 |
6 | 10254042103425 |
7 | 1010105206526 |
oct | 151216200011 |
9 | 40422331688 |
10 | 14130151433 |
11 | 5aa1113a02 |
12 | 28a41aab75 |
13 | 144257b568 |
14 | 9808b614d |
15 | 57a791808 |
hex | 34a390009 |
14130151433 has 2 divisors, whose sum is σ = 14130151434. Its totient is φ = 14130151432.
The previous prime is 14130151417. The next prime is 14130151457. The reversal of 14130151433 is 33415103141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12852303424 + 1277848009 = 113368^2 + 35747^2 .
It is a cyclic number.
It is not a de Polignac number, because 14130151433 - 24 = 14130151417 is a prime.
It is a super-2 number, since 2×141301514332 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (14130151493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7065075716 + 7065075717.
It is an arithmetic number, because the mean of its divisors is an integer number (7065075717).
Almost surely, 214130151433 is an apocalyptic number.
It is an amenable number.
14130151433 is a deficient number, since it is larger than the sum of its proper divisors (1).
14130151433 is an equidigital number, since it uses as much as digits as its factorization.
14130151433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 14130151433 its reverse (33415103141), we get a palindrome (47545254574).
The spelling of 14130151433 in words is "fourteen billion, one hundred thirty million, one hundred fifty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •