Base | Representation |
---|---|
bin | 11110110000001001110… |
… | …10010010101001101101 |
3 | 10202000101100202021011121 |
4 | 33120010322102221231 |
5 | 114303001423010204 |
6 | 2125225443220541 |
7 | 136224426510232 |
oct | 17300472225155 |
9 | 3660340667147 |
10 | 1056644344429 |
11 | 378136205293 |
12 | 150950077751 |
13 | 78844757ccb |
14 | 391db393789 |
15 | 1c7445c0b54 |
hex | f604e92a6d |
1056644344429 has 2 divisors, whose sum is σ = 1056644344430. Its totient is φ = 1056644344428.
The previous prime is 1056644344411. The next prime is 1056644344477. The reversal of 1056644344429 is 9244434466501.
1056644344429 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1038568886404 + 18075458025 = 1019102^2 + 134445^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056644344429 - 211 = 1056644342381 is a prime.
It is a super-2 number, since 2×10566443444292 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1056644344729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528322172214 + 528322172215.
It is an arithmetic number, because the mean of its divisors is an integer number (528322172215).
Almost surely, 21056644344429 is an apocalyptic number.
It is an amenable number.
1056644344429 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056644344429 is an equidigital number, since it uses as much as digits as its factorization.
1056644344429 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9953280, while the sum is 52.
The spelling of 1056644344429 in words is "one trillion, fifty-six billion, six hundred forty-four million, three hundred forty-four thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •