Base | Representation |
---|---|
bin | 11011000100010110… |
… | …01110100100101011 |
3 | 1101111202112201021221 |
4 | 31202023032210223 |
5 | 214230143343311 |
6 | 10401555242511 |
7 | 1023055031614 |
oct | 154213164453 |
9 | 41452481257 |
10 | 14532012331 |
11 | 6187a3aa51 |
12 | 29968a9437 |
13 | 14a78c1b85 |
14 | 9bc002c0b |
15 | 5a0bc1671 |
hex | 3622ce92b |
14532012331 has 2 divisors, whose sum is σ = 14532012332. Its totient is φ = 14532012330.
The previous prime is 14532012323. The next prime is 14532012343. The reversal of 14532012331 is 13321023541.
It is a happy number.
14532012331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14532012331 - 23 = 14532012323 is a prime.
It is a super-2 number, since 2×145320123312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14532012296 and 14532012305.
It is not a weakly prime, because it can be changed into another prime (14532012311) 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, 7266006165 + 7266006166.
It is an arithmetic number, because the mean of its divisors is an integer number (7266006166).
Almost surely, 214532012331 is an apocalyptic number.
14532012331 is a deficient number, since it is larger than the sum of its proper divisors (1).
14532012331 is an equidigital number, since it uses as much as digits as its factorization.
14532012331 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 25.
Adding to 14532012331 its reverse (13321023541), we get a palindrome (27853035872).
The spelling of 14532012331 in words is "fourteen billion, five hundred thirty-two million, twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •