Base | Representation |
---|---|
bin | 1101001100010001100100… |
… | …0100101011010110110101 |
3 | 1220100121201022010102012102 |
4 | 3103010121010223112311 |
5 | 3400120231423341112 |
6 | 50503141545231445 |
7 | 3024626441050145 |
oct | 323043104532665 |
9 | 56317638112172 |
10 | 14504525215157 |
11 | 469237539621a |
12 | 17630a8192585 |
13 | 812a03766613 |
14 | 382046682925 |
15 | 1a2468e50bc2 |
hex | d311912b5b5 |
14504525215157 has 2 divisors, whose sum is σ = 14504525215158. Its totient is φ = 14504525215156.
The previous prime is 14504525215151. The next prime is 14504525215241. The reversal of 14504525215157 is 75151252540541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9157396202161 + 5347129012996 = 3026119^2 + 2312386^2 .
It is an emirp because it is prime and its reverse (75151252540541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14504525215157 - 226 = 14504458106293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14504525215151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7252262607578 + 7252262607579.
It is an arithmetic number, because the mean of its divisors is an integer number (7252262607579).
Almost surely, 214504525215157 is an apocalyptic number.
It is an amenable number.
14504525215157 is a deficient number, since it is larger than the sum of its proper divisors (1).
14504525215157 is an equidigital number, since it uses as much as digits as its factorization.
14504525215157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1400000, while the sum is 47.
Adding to 14504525215157 its reverse (75151252540541), we get a palindrome (89655777755698).
The spelling of 14504525215157 in words is "fourteen trillion, five hundred four billion, five hundred twenty-five million, two hundred fifteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •