Base | Representation |
---|---|
bin | 10101001100100101010… |
… | …110110111001101101101 |
3 | 12011020210101202112020221 |
4 | 111030211112313031231 |
5 | 142331124342214121 |
6 | 3033055020011341 |
7 | 210144263232142 |
oct | 25144526671555 |
9 | 5136711675227 |
10 | 1456620663661 |
11 | 5118274329a9 |
12 | 1b6377390b51 |
13 | a74881c4757 |
14 | 507023503c9 |
15 | 27d53d8cb41 |
hex | 153255b736d |
1456620663661 has 2 divisors, whose sum is σ = 1456620663662. Its totient is φ = 1456620663660.
The previous prime is 1456620663629. The next prime is 1456620663677. The reversal of 1456620663661 is 1663660266541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1192212853225 + 264407810436 = 1091885^2 + 514206^2 .
It is a cyclic number.
It is not a de Polignac number, because 1456620663661 - 25 = 1456620663629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1456620663599 and 1456620663608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1456620663161) 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, 728310331830 + 728310331831.
It is an arithmetic number, because the mean of its divisors is an integer number (728310331831).
Almost surely, 21456620663661 is an apocalyptic number.
It is an amenable number.
1456620663661 is a deficient number, since it is larger than the sum of its proper divisors (1).
1456620663661 is an equidigital number, since it uses as much as digits as its factorization.
1456620663661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5598720, while the sum is 52.
The spelling of 1456620663661 in words is "one trillion, four hundred fifty-six billion, six hundred twenty million, six hundred sixty-three thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •