Base | Representation |
---|---|
bin | 10010101111011… |
… | …10100000101000 |
3 | 101221211100002220 |
4 | 21113232200220 |
5 | 310221333020 |
6 | 23333354040 |
7 | 3616206033 |
oct | 1127564050 |
9 | 357740086 |
10 | 157214760 |
11 | 8081a85a |
12 | 44798920 |
13 | 26756ab1 |
14 | 16c4601a |
15 | dc07240 |
hex | 95ee828 |
157214760 has 32 divisors (see below), whose sum is σ = 471644640. Its totient is φ = 41923904.
The previous prime is 157214747. The next prime is 157214773. The reversal of 157214760 is 67412751.
157214760 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (157214747) and next prime (157214773).
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 7 ways as a sum of consecutive naturals, for example, 654942 + ... + 655181.
It is an arithmetic number, because the mean of its divisors is an integer number (14738895).
Almost surely, 2157214760 is an apocalyptic number.
157214760 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
157214760 is an abundant number, since it is smaller than the sum of its proper divisors (314429880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157214760 is a wasteful number, since it uses less digits than its factorization.
157214760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1310137 (or 1310133 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 33.
The square root of 157214760 is about 12538.5310144371. The cubic root of 157214760 is about 539.7149387083.
The spelling of 157214760 in words is "one hundred fifty-seven million, two hundred fourteen thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •