Base | Representation |
---|---|
bin | 11011111011000010… |
… | …01111010111000001 |
3 | 1102200201202220011002 |
4 | 31331201033113001 |
5 | 221200114030203 |
6 | 10515304101345 |
7 | 1040325264446 |
oct | 157541172701 |
9 | 42621686132 |
10 | 14990767553 |
11 | 63a29965a3 |
12 | 2aa4464855 |
13 | 154b965978 |
14 | a22cdd9cd |
15 | 5cb0ddd88 |
hex | 37d84f5c1 |
14990767553 has 2 divisors, whose sum is σ = 14990767554. Its totient is φ = 14990767552.
The previous prime is 14990767513. The next prime is 14990767601. The reversal of 14990767553 is 35576709941.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8294291329 + 6696476224 = 91073^2 + 81832^2 .
It is a cyclic number.
It is not a de Polignac number, because 14990767553 - 230 = 13917025729 is a prime.
It is a super-2 number, since 2×149907675532 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14990767513) 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, 7495383776 + 7495383777.
It is an arithmetic number, because the mean of its divisors is an integer number (7495383777).
Almost surely, 214990767553 is an apocalyptic number.
It is an amenable number.
14990767553 is a deficient number, since it is larger than the sum of its proper divisors (1).
14990767553 is an equidigital number, since it uses as much as digits as its factorization.
14990767553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7144200, while the sum is 56.
The spelling of 14990767553 in words is "fourteen billion, nine hundred ninety million, seven hundred sixty-seven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •