Base | Representation |
---|---|
bin | 11110101111000010011… |
… | …01100101101000001001 |
3 | 10201221211121202220120122 |
4 | 33113201031211220021 |
5 | 114300240112014423 |
6 | 2125050210233025 |
7 | 136203534663032 |
oct | 17274115455011 |
9 | 3657747686518 |
10 | 1056045423113 |
11 | 37795912389a |
12 | 150803585775 |
13 | 7877a6493b5 |
14 | 39181a0ba89 |
15 | 1c70bc178c8 |
hex | f5e1365a09 |
1056045423113 has 2 divisors, whose sum is σ = 1056045423114. Its totient is φ = 1056045423112.
The previous prime is 1056045423091. The next prime is 1056045423217. The reversal of 1056045423113 is 3113245406501.
1056045423113 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., 891271941184 + 164773481929 = 944072^2 + 405923^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056045423113 - 220 = 1056044374537 is a prime.
It is a super-2 number, since 2×10560454231132 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1056045426113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528022711556 + 528022711557.
It is an arithmetic number, because the mean of its divisors is an integer number (528022711557).
Almost surely, 21056045423113 is an apocalyptic number.
It is an amenable number.
1056045423113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056045423113 is an equidigital number, since it uses as much as digits as its factorization.
1056045423113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 43200, while the sum is 35.
The spelling of 1056045423113 in words is "one trillion, fifty-six billion, forty-five million, four hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •