Search a number
-
+
1256770485152 = 2572131931104677
BaseRepresentation
bin10010010010011101010…
…110111011101110100000
311110010221111101120012122
4102102131112323232200
5131042331221011102
62401204041043412
7156540641602400
oct22223526735640
94403844346178
101256770485152
11444aa21a1916
121836a1a86568
1391688c41160
1444b8410c800
1522a58b600a2
hex1249d5bbba0

1256770485152 has 288 divisors, whose sum is σ = 3368052334080. Its totient is φ = 455817922560.

The previous prime is 1256770485127. The next prime is 1256770485169. The reversal of 1256770485152 is 2515840776521.

It is a junction number, because it is equal to n+sod(n) for n = 1256770485094 and 1256770485103.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11953838 + ... + 12058514.

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

Almost surely, 21256770485152 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 4704000, while the sum is 53.

The spelling of 1256770485152 in words is "one trillion, two hundred fifty-six billion, seven hundred seventy million, four hundred eighty-five thousand, one hundred fifty-two".