Base | Representation |
---|---|
bin | 1010010010101001111100… |
… | …0100101001101101110101 |
3 | 1111001202120111112201122202 |
4 | 2210222133010221231311 |
5 | 2440343333314420303 |
6 | 40022153134034245 |
7 | 2245345300401002 |
oct | 244523704515565 |
9 | 44052514481582 |
10 | 11315612654453 |
11 | 3672a19389618 |
12 | 132905b948985 |
13 | 6410999a8423 |
14 | 2b197001a8a9 |
15 | 149529849c88 |
hex | a4a9f129b75 |
11315612654453 has 2 divisors, whose sum is σ = 11315612654454. Its totient is φ = 11315612654452.
The previous prime is 11315612654419. The next prime is 11315612654473. The reversal of 11315612654453 is 35445621651311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8170782137764 + 3144830516689 = 2858458^2 + 1773367^2 .
It is a cyclic number.
It is not a de Polignac number, because 11315612654453 - 218 = 11315612392309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11315612654398 and 11315612654407.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11315612654473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5657806327226 + 5657806327227.
It is an arithmetic number, because the mean of its divisors is an integer number (5657806327227).
Almost surely, 211315612654453 is an apocalyptic number.
It is an amenable number.
11315612654453 is a deficient number, since it is larger than the sum of its proper divisors (1).
11315612654453 is an equidigital number, since it uses as much as digits as its factorization.
11315612654453 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1296000, while the sum is 47.
The spelling of 11315612654453 in words is "eleven trillion, three hundred fifteen billion, six hundred twelve million, six hundred fifty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •