Base | Representation |
---|---|
bin | 11110101111011010010… |
… | …01110111101111010000 |
3 | 10201222100120202212010110 |
4 | 33113231021313233100 |
5 | 114301142404302222 |
6 | 2125122124401320 |
7 | 136211516645160 |
oct | 17275511675720 |
9 | 3658316685113 |
10 | 1056245775312 |
11 | 377a51227422 |
12 | 15085a6a6240 |
13 | 787accc7ab0 |
14 | 391a04825a0 |
15 | 1c71e5e130c |
hex | f5ed277bd0 |
1056245775312 has 160 divisors (see below), whose sum is σ = 3415241410560. Its totient is φ = 273848716800.
The previous prime is 1056245775311. The next prime is 1056245775323. The reversal of 1056245775312 is 2135775426501.
It is a super-2 number, since 2×10562457753122 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056245775311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1791564 + ... + 2306987.
It is an arithmetic number, because the mean of its divisors is an integer number (21345258816).
Almost surely, 21056245775312 is an apocalyptic number.
1056245775312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1056245775312 is an abundant number, since it is smaller than the sum of its proper divisors (2358995635248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056245775312 is a wasteful number, since it uses less digits than its factorization.
1056245775312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4098641 (or 4098635 counting only the distinct ones).
The product of its (nonzero) digits is 1764000, while the sum is 48.
The spelling of 1056245775312 in words is "one trillion, fifty-six billion, two hundred forty-five million, seven hundred seventy-five thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •