Base | Representation |
---|---|
bin | 11011000110010110… |
… | …01110001100111101 |
3 | 1101112221010000020002 |
4 | 31203023032030331 |
5 | 214243442204104 |
6 | 10403355004045 |
7 | 1023350441426 |
oct | 154313161475 |
9 | 41487100202 |
10 | 14548788029 |
11 | 6196458866 |
12 | 29a0439625 |
13 | 14ab216819 |
14 | 9c032c64d |
15 | 5a23d701e |
hex | 3632ce33d |
14548788029 has 2 divisors, whose sum is σ = 14548788030. Its totient is φ = 14548788028.
The previous prime is 14548787989. The next prime is 14548788031. The reversal of 14548788029 is 92088784541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10717425625 + 3831362404 = 103525^2 + 61898^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14548788029 is a prime.
It is a super-2 number, since 2×145487880292 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 14548788031, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14548788629) 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, 7274394014 + 7274394015.
It is an arithmetic number, because the mean of its divisors is an integer number (7274394015).
Almost surely, 214548788029 is an apocalyptic number.
It is an amenable number.
14548788029 is a deficient number, since it is larger than the sum of its proper divisors (1).
14548788029 is an equidigital number, since it uses as much as digits as its factorization.
14548788029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5160960, while the sum is 56.
The spelling of 14548788029 in words is "fourteen billion, five hundred forty-eight million, seven hundred eighty-eight thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •