Base | Representation |
---|---|
bin | 11110101111011001000… |
… | …11101110000111110011 |
3 | 10201222022212221202112012 |
4 | 33113230203232013303 |
5 | 114301132324240301 |
6 | 2125121130153135 |
7 | 136211335643144 |
oct | 17275443560763 |
9 | 3658285852465 |
10 | 1056235774451 |
11 | 377a46616650 |
12 | 1508572827ab |
13 | 787aac05a20 |
14 | 3919cddbacb |
15 | 1c71d7b7ebb |
hex | f5ec8ee1f3 |
1056235774451 has 32 divisors (see below), whose sum is σ = 1276554369216. Its totient is φ = 860958720000.
The previous prime is 1056235774439. The next prime is 1056235774493. The reversal of 1056235774451 is 1544775326501.
It is a cyclic number.
It is not a de Polignac number, because 1056235774451 - 26 = 1056235774387 is a prime.
It is a super-2 number, since 2×10562357744512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1056235774451.
It is not an unprimeable number, because it can be changed into a prime (1056235774421) 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, 3013811 + ... + 3345971.
It is an arithmetic number, because the mean of its divisors is an integer number (39892324038).
Almost surely, 21056235774451 is an apocalyptic number.
1056235774451 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1056235774451 is a deficient number, since it is larger than the sum of its proper divisors (220318594765).
1056235774451 is a wasteful number, since it uses less digits than its factorization.
1056235774451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332823.
The product of its (nonzero) digits is 3528000, while the sum is 50.
The spelling of 1056235774451 in words is "one trillion, fifty-six billion, two hundred thirty-five million, seven hundred seventy-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •