Base | Representation |
---|---|
bin | 1100010001111000011010… |
… | …1001001001100001000001 |
3 | 1202210201022200022110210201 |
4 | 3010132012221021201001 |
5 | 3232201221313121103 |
6 | 44414232553125201 |
7 | 2562303551126161 |
oct | 304360651114101 |
9 | 52721280273721 |
10 | 13501341145153 |
11 | 4335983108414 |
12 | 16207979b9801 |
13 | 76c22b918cb4 |
14 | 34967b3da5a1 |
15 | 186302dd651d |
hex | c4786a49841 |
13501341145153 has 2 divisors, whose sum is σ = 13501341145154. Its totient is φ = 13501341145152.
The previous prime is 13501341145111. The next prime is 13501341145157. The reversal of 13501341145153 is 35154114310531.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10730754263089 + 2770586882064 = 3275783^2 + 1664508^2 .
It is a cyclic number.
It is not a de Polignac number, because 13501341145153 - 241 = 11302317889601 is a prime.
It is not a weakly prime, because it can be changed into another prime (13501341145157) 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, 6750670572576 + 6750670572577.
It is an arithmetic number, because the mean of its divisors is an integer number (6750670572577).
Almost surely, 213501341145153 is an apocalyptic number.
It is an amenable number.
13501341145153 is a deficient number, since it is larger than the sum of its proper divisors (1).
13501341145153 is an equidigital number, since it uses as much as digits as its factorization.
13501341145153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54000, while the sum is 37.
Adding to 13501341145153 its reverse (35154114310531), we get a palindrome (48655455455684).
The spelling of 13501341145153 in words is "thirteen trillion, five hundred one billion, three hundred forty-one million, one hundred forty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •