Base | Representation |
---|---|
bin | 101000000111110001000… |
… | …0110001110100100111001 |
3 | 201112011012121111001000122 |
4 | 1100033202012032210321 |
5 | 1210321123444333103 |
6 | 15421112153343025 |
7 | 1106250626252654 |
oct | 120174206164471 |
9 | 21464177431018 |
10 | 5514236324153 |
11 | 1836635716007 |
12 | 750842707a75 |
13 | 30ccb478588b |
14 | 150c675dc89b |
15 | 986880b9b38 |
hex | 503e218e939 |
5514236324153 has 2 divisors, whose sum is σ = 5514236324154. Its totient is φ = 5514236324152.
The previous prime is 5514236324143. The next prime is 5514236324197. The reversal of 5514236324153 is 3514236324155.
It is an a-pointer prime, because the next prime (5514236324197) can be obtained adding 5514236324153 to its sum of digits (44).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5358470336569 + 155765987584 = 2314837^2 + 394672^2 .
It is a cyclic number.
It is not a de Polignac number, because 5514236324153 - 212 = 5514236320057 is a prime.
It is not a weakly prime, because it can be changed into another prime (5514236324143) 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, 2757118162076 + 2757118162077.
It is an arithmetic number, because the mean of its divisors is an integer number (2757118162077).
Almost surely, 25514236324153 is an apocalyptic number.
It is an amenable number.
5514236324153 is a deficient number, since it is larger than the sum of its proper divisors (1).
5514236324153 is an equidigital number, since it uses as much as digits as its factorization.
5514236324153 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1296000, while the sum is 44.
The spelling of 5514236324153 in words is "five trillion, five hundred fourteen billion, two hundred thirty-six million, three hundred twenty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •