Base | Representation |
---|---|
bin | 11110101111000011010… |
… | …00011101001111011010 |
3 | 10201221212010000202111101 |
4 | 33113201220131033122 |
5 | 114300243412413100 |
6 | 2125051021222014 |
7 | 136203651600106 |
oct | 17274150351732 |
9 | 3657763022441 |
10 | 1056052466650 |
11 | 3779620a47a5 |
12 | 150805a0190a |
13 | 7877bc4437c |
14 | 39182922906 |
15 | 1c70c65986a |
hex | f5e1a1d3da |
1056052466650 has 48 divisors (see below), whose sum is σ = 2015228160000. Its totient is φ = 411586300160.
The previous prime is 1056052466533. The next prime is 1056052466653. The reversal of 1056052466650 is 566642506501.
It is a super-2 number, since 2×10560524666502 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1056052466650.
It is not an unprimeable number, because it can be changed into a prime (1056052466653) 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 in 23 ways as a sum of consecutive naturals, for example, 1250650 + ... + 1917349.
It is an arithmetic number, because the mean of its divisors is an integer number (41983920000).
Almost surely, 21056052466650 is an apocalyptic number.
1056052466650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1056052466650 is a deficient number, since it is larger than the sum of its proper divisors (959175693350).
1056052466650 is a wasteful number, since it uses less digits than its factorization.
1056052466650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3168183 (or 3168178 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 46.
The spelling of 1056052466650 in words is "one trillion, fifty-six billion, fifty-two million, four hundred sixty-six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •