Search a number
-
+
1370520000 = 26365447
BaseRepresentation
bin101000110110000…
…0111100111000000
310112111212122000000
41101230013213000
510301323120000
6343555000000
745651141063
oct12154074700
93474778000
101370520000
11643693a63
12322b99000
1318ac293a5
14d003a8da
15804c0000
hex51b079c0

1370520000 has 490 divisors, whose sum is σ = 5203746768. Its totient is φ = 357696000.

The previous prime is 1370519999. The next prime is 1370520017. The reversal of 1370520000 is 250731.

It is a Harshad number since it is a multiple of its sum of digits (18).

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 69 ways as a sum of consecutive naturals, for example, 29159977 + ... + 29160023.

Almost surely, 21370520000 is an apocalyptic number.

1370520000 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 1370520000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2601873384).

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

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

1370520000 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 210, while the sum is 18.

The square root of 1370520000 is about 37020.5348421656. The cubic root of 1370520000 is about 1110.7810426998.

Adding to 1370520000 its reverse (250731), we get a palindrome (1370770731).

The spelling of 1370520000 in words is "one billion, three hundred seventy million, five hundred twenty thousand".