Base | Representation |
---|---|
bin | 11110101111100011011… |
… | …10001101111011010101 |
3 | 10201222112220222102020101 |
4 | 33113301232031323111 |
5 | 114301322014142440 |
6 | 2125133503134101 |
7 | 136213440233362 |
oct | 17276156157325 |
9 | 3658486872211 |
10 | 1056322412245 |
11 | 377a90510931 |
12 | 1508802a4331 |
13 | 787c2b4b4a9 |
14 | 391aa711469 |
15 | 1c7261cd69a |
hex | f5f1b8ded5 |
1056322412245 has 64 divisors (see below), whose sum is σ = 1404890308800. Its totient is φ = 759136665600.
The previous prime is 1056322412107. The next prime is 1056322412273. The reversal of 1056322412245 is 5422142236501.
It can be written as a sum of positive squares in 32 ways, for example, as 214407893764 + 841914518481 = 463042^2 + 917559^2 .
It is not a de Polignac number, because 1056322412245 - 221 = 1056320315093 is a prime.
It is a super-2 number, since 2×10563224122452 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 34608051 + ... + 34638559.
It is an arithmetic number, because the mean of its divisors is an integer number (21951411075).
Almost surely, 21056322412245 is an apocalyptic number.
It is an amenable number.
1056322412245 is a deficient number, since it is larger than the sum of its proper divisors (348567896555).
1056322412245 is a wasteful number, since it uses less digits than its factorization.
1056322412245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30778.
The product of its (nonzero) digits is 115200, while the sum is 37.
Adding to 1056322412245 its reverse (5422142236501), we get a palindrome (6478464648746).
The spelling of 1056322412245 in words is "one trillion, fifty-six billion, three hundred twenty-two million, four hundred twelve thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •