Base | Representation |
---|---|
bin | 11110110000001010100… |
… | …00011101100001101000 |
3 | 10202000101202200112100000 |
4 | 33120011100131201220 |
5 | 114303004414444021 |
6 | 2125230211543000 |
7 | 136224530064051 |
oct | 17300520354150 |
9 | 3660352615300 |
10 | 1056650156136 |
11 | 378139514753 |
12 | 150951bbaa60 |
13 | 78845a113a3 |
14 | 391dc067728 |
15 | 1c744d6cb26 |
hex | f60541d868 |
1056650156136 has 96 divisors (see below), whose sum is σ = 3047961702240. Its totient is φ = 342697324608.
The previous prime is 1056650156123. The next prime is 1056650156141. The reversal of 1056650156136 is 6316510566501.
1056650156136 is a `hidden beast` number, since 1 + 0 + 5 + 6 + 6 + 50 + 1 + 561 + 36 = 666.
It is a super-2 number, since 2×10566501561362 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1056650156091 and 1056650156100.
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, 7273266 + ... + 7417121.
It is an arithmetic number, because the mean of its divisors is an integer number (31749601065).
Almost surely, 21056650156136 is an apocalyptic number.
It is an amenable number.
1056650156136 is an abundant number, since it is smaller than the sum of its proper divisors (1991311546104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056650156136 is a wasteful number, since it uses less digits than its factorization.
1056650156136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14690445 (or 14690429 counting only the distinct ones).
The product of its (nonzero) digits is 486000, while the sum is 45.
The spelling of 1056650156136 in words is "one trillion, fifty-six billion, six hundred fifty million, one hundred fifty-six thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •