Base | Representation |
---|---|
bin | 101011011100001… |
… | …0101010000101000 |
3 | 10202120202010220010 |
4 | 1112320111100220 |
5 | 10441121421340 |
6 | 400345331520 |
7 | 51056314122 |
oct | 12670252050 |
9 | 3676663803 |
10 | 1457607720 |
11 | 688866288 |
12 | 348196ba0 |
13 | 1a2c9b89a |
14 | db82a212 |
15 | 87e73b80 |
hex | 56e15428 |
1457607720 has 32 divisors (see below), whose sum is σ = 4372823520. Its totient is φ = 388695360.
The previous prime is 1457607707. The next prime is 1457607721. The reversal of 1457607720 is 277067541.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (1457607721) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 6073246 + ... + 6073485.
It is an arithmetic number, because the mean of its divisors is an integer number (136650735).
Almost surely, 21457607720 is an apocalyptic number.
1457607720 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1457607720 is an abundant number, since it is smaller than the sum of its proper divisors (2915215800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1457607720 is a wasteful number, since it uses less digits than its factorization.
1457607720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12146745 (or 12146741 counting only the distinct ones).
The product of its (nonzero) digits is 82320, while the sum is 39.
The square root of 1457607720 is about 38178.6291005845. The cubic root of 1457607720 is about 1133.8272399338.
The spelling of 1457607720 in words is "one billion, four hundred fifty-seven million, six hundred seven thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •