Base | Representation |
---|---|
bin | 11110110000001010100… |
… | …00011110100101000010 |
3 | 10202000101202200202020210 |
4 | 33120011100132211002 |
5 | 114303004420113300 |
6 | 2125230212014550 |
7 | 136224530112453 |
oct | 17300520364502 |
9 | 3660352622223 |
10 | 1056650160450 |
11 | 378139517a15 |
12 | 150952001456 |
13 | 78845a13341 |
14 | 391dc06912a |
15 | 1c744d6e050 |
hex | f60541e942 |
1056650160450 has 48 divisors (see below), whose sum is σ = 2629752194016. Its totient is φ = 280777699200.
The previous prime is 1056650160409. The next prime is 1056650160497. The reversal of 1056650160450 is 540610566501.
It is a super-2 number, since 2×10566501604502 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1056650160399 and 1056650160408.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12403371 + ... + 12488270.
It is an arithmetic number, because the mean of its divisors is an integer number (54786504042).
Almost surely, 21056650160450 is an apocalyptic number.
1056650160450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1056650160450 is an abundant number, since it is smaller than the sum of its proper divisors (1573102033566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056650160450 is a wasteful number, since it uses less digits than its factorization.
1056650160450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24891939 (or 24891934 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 39.
The spelling of 1056650160450 in words is "one trillion, fifty-six billion, six hundred fifty million, one hundred sixty thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •