Base | Representation |
---|---|
bin | 1010100001100111011011… |
… | …0000100111010001000001 |
3 | 1111222022222210012201011101 |
4 | 2220121312300213101001 |
5 | 3004101223343210112 |
6 | 40340221141014401 |
7 | 2303044444642162 |
oct | 250316660472101 |
9 | 44868883181141 |
10 | 11572634350657 |
11 | 3761a21436086 |
12 | 136aa2b9b4401 |
13 | 65c3aa6c8733 |
14 | 2c01931d5769 |
15 | 15106dd16757 |
hex | a8676c27441 |
11572634350657 has 2 divisors, whose sum is σ = 11572634350658. Its totient is φ = 11572634350656.
The previous prime is 11572634350591. The next prime is 11572634350661. The reversal of 11572634350657 is 75605343627511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11556899407936 + 15734942721 = 3399544^2 + 125439^2 .
It is a cyclic number.
It is not a de Polignac number, because 11572634350657 - 223 = 11572625962049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11572634350598 and 11572634350607.
It is not a weakly prime, because it can be changed into another prime (11572634354657) 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, 5786317175328 + 5786317175329.
It is an arithmetic number, because the mean of its divisors is an integer number (5786317175329).
Almost surely, 211572634350657 is an apocalyptic number.
It is an amenable number.
11572634350657 is a deficient number, since it is larger than the sum of its proper divisors (1).
11572634350657 is an equidigital number, since it uses as much as digits as its factorization.
11572634350657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15876000, while the sum is 55.
The spelling of 11572634350657 in words is "eleven trillion, five hundred seventy-two billion, six hundred thirty-four million, three hundred fifty thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •