Search a number
-
+
1055740483460 = 22513173713149279
BaseRepresentation
bin11110101110011110000…
…10010101011110000100
310201221001100222101000102
433113033002111132010
5114244124030432320
62125000034303232
7136163143021115
oct17271702253604
93657040871012
101055740483460
11377811a86153
12150739427b18
137872c40c130
143915331020c
151c6e0080175
hexf5cf095784

1055740483460 has 192 divisors, whose sum is σ = 2616242872320. Its totient is φ = 354233917440.

The previous prime is 1055740483459. The next prime is 1055740483487. The reversal of 1055740483460 is 643840475501.

It is a super-2 number, since 2×10557404834602 (a number of 25 digits) contains 22 as substring.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 21399101 + ... + 21448379.

It is an arithmetic number, because the mean of its divisors is an integer number (13626264960).

Almost surely, 21055740483460 is an apocalyptic number.

1055740483460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1055740483460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1308121436160).

1055740483460 is an abundant number, since it is smaller than the sum of its proper divisors (1560502388860).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

1055740483460 is a wasteful number, since it uses less digits than its factorization.

1055740483460 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 49486 (or 49484 counting only the distinct ones).

The product of its (nonzero) digits is 1612800, while the sum is 47.

The spelling of 1055740483460 in words is "one trillion, fifty-five billion, seven hundred forty million, four hundred eighty-three thousand, four hundred sixty".