Base | Representation |
---|---|
bin | 101011100000110… |
… | …1010011000000000 |
3 | 10202202100101212201 |
4 | 1113001222120000 |
5 | 10442233203004 |
6 | 400514002544 |
7 | 51116151520 |
oct | 12701523000 |
9 | 3682311781 |
10 | 1460053504 |
11 | 68a186898 |
12 | 348b76454 |
13 | 1a3646bb0 |
14 | dbca5680 |
15 | 882a86a4 |
hex | 5706a600 |
1460053504 has 80 divisors (see below), whose sum is σ = 3590582688. Its totient is φ = 577585152.
The previous prime is 1460053493. The next prime is 1460053523. The reversal of 1460053504 is 4053500641.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30924 + ... + 62260.
Almost surely, 21460053504 is an apocalyptic number.
1460053504 is a gapful number since it is divisible by the number (14) 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 1460053504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1795291344).
1460053504 is an abundant number, since it is smaller than the sum of its proper divisors (2130529184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1460053504 is an equidigital number, since it uses as much as digits as its factorization.
1460053504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31375 (or 31359 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 1460053504 is about 38210.6464745102. The cubic root of 1460053504 is about 1134.4610517372.
The spelling of 1460053504 in words is "one billion, four hundred sixty million, fifty-three thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •