Base | Representation |
---|---|
bin | 101110011010010… |
… | …1001011010111100 |
3 | 11000112100021212201 |
4 | 1130310221122330 |
5 | 11142132230040 |
6 | 414310241244 |
7 | 53406605605 |
oct | 13464513274 |
9 | 4015307781 |
10 | 1557305020 |
11 | 72a070347 |
12 | 375656224 |
13 | 1ba83767b |
14 | 10ab7cdac |
15 | 91ab8a9a |
hex | 5cd296bc |
1557305020 has 12 divisors (see below), whose sum is σ = 3270340584. Its totient is φ = 622922000.
The previous prime is 1557305011. The next prime is 1557305021. The reversal of 1557305020 is 205037551.
It is a self number, because there is not a number n which added to its sum of digits gives 1557305020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1557305021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38932606 + ... + 38932645.
It is an arithmetic number, because the mean of its divisors is an integer number (272528382).
Almost surely, 21557305020 is an apocalyptic number.
1557305020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1557305020 is an abundant number, since it is smaller than the sum of its proper divisors (1713035564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1557305020 is a wasteful number, since it uses less digits than its factorization.
1557305020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77865260 (or 77865258 counting only the distinct ones).
The product of its (nonzero) digits is 5250, while the sum is 28.
The square root of 1557305020 is about 39462.7041648187. The cubic root of 1557305020 is about 1159.1097559169.
The spelling of 1557305020 in words is "one billion, five hundred fifty-seven million, three hundred five thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •