Base | Representation |
---|---|
bin | 101011011011010… |
… | …1101010111001110 |
3 | 10202112221112010120 |
4 | 1112312231113032 |
5 | 10441014312113 |
6 | 400332245410 |
7 | 51052562325 |
oct | 12666552716 |
9 | 3675845116 |
10 | 1457182158 |
11 | 6885a5583 |
12 | 348010866 |
13 | 1a2b7cc83 |
14 | db7590bc |
15 | 87ddca23 |
hex | 56dad5ce |
1457182158 has 16 divisors (see below), whose sum is σ = 3041076096. Its totient is φ = 464608760.
The previous prime is 1457182157. The next prime is 1457182193. The reversal of 1457182158 is 8512817541.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1457182157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5279508 + ... + 5279783.
It is an arithmetic number, because the mean of its divisors is an integer number (190067256).
Almost surely, 21457182158 is an apocalyptic number.
1457182158 is an abundant number, since it is smaller than the sum of its proper divisors (1583893938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1457182158 is a wasteful number, since it uses less digits than its factorization.
1457182158 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10559319.
The product of its digits is 89600, while the sum is 42.
The square root of 1457182158 is about 38173.0553925148. The cubic root of 1457182158 is about 1133.7168854246.
Adding to 1457182158 its reverse (8512817541), we get a palindrome (9969999699).
The spelling of 1457182158 in words is "one billion, four hundred fifty-seven million, one hundred eighty-two thousand, one hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •