Base | Representation |
---|---|
bin | 11110101111001000100… |
… | …01110110111110000000 |
3 | 10201221222012120220102200 |
4 | 33113210101312332000 |
5 | 114300341244434433 |
6 | 2125055245113200 |
7 | 136205031213504 |
oct | 17274421667600 |
9 | 3657865526380 |
10 | 1056096874368 |
11 | 377985175998 |
12 | 150818858800 |
13 | 787881c2223 |
14 | 391887a2304 |
15 | 1c7114cc613 |
hex | f5e4476f80 |
1056096874368 has 48 divisors (see below), whose sum is σ = 3039028769400. Its totient is φ = 352032291072.
The previous prime is 1056096874319. The next prime is 1056096874369. The reversal of 1056096874368 is 8634786906501.
1056096874368 is a `hidden beast` number, since 1 + 0 + 560 + 9 + 6 + 8 + 7 + 4 + 3 + 68 = 666.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×10560968743682 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056096874369) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 458374228 + ... + 458376531.
Almost surely, 21056096874368 is an apocalyptic number.
1056096874368 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1056096874368 is an abundant number, since it is smaller than the sum of its proper divisors (1982931895032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056096874368 is an equidigital number, since it uses as much as digits as its factorization.
1056096874368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 916750779 (or 916750764 counting only the distinct ones).
The product of its (nonzero) digits is 52254720, while the sum is 63.
The spelling of 1056096874368 in words is "one trillion, fifty-six billion, ninety-six million, eight hundred seventy-four thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •