Base | Representation |
---|---|
bin | 10010000101001… |
… | …11010011010101 |
3 | 101120102011010200 |
4 | 21002213103111 |
5 | 302312231323 |
6 | 23015011113 |
7 | 3521155236 |
oct | 1102472325 |
9 | 346364120 |
10 | 151680213 |
11 | 7868a653 |
12 | 42969a99 |
13 | 25569909 |
14 | 1620508d |
15 | d4b2443 |
hex | 90a74d5 |
151680213 has 12 divisors (see below), whose sum is σ = 219474528. Its totient is φ = 100944360.
The previous prime is 151680187. The next prime is 151680229. The reversal of 151680213 is 312086151.
It is not a de Polignac number, because 151680213 - 25 = 151680181 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151680713) 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 11 ways as a sum of consecutive naturals, for example, 9073 + ... + 19638.
It is an arithmetic number, because the mean of its divisors is an integer number (18289544).
Almost surely, 2151680213 is an apocalyptic number.
It is an amenable number.
151680213 is a deficient number, since it is larger than the sum of its proper divisors (67794315).
151680213 is a wasteful number, since it uses less digits than its factorization.
151680213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29304 (or 29301 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 151680213 is about 12315.8521020675. The cubic root of 151680213 is about 533.3058037439.
The spelling of 151680213 in words is "one hundred fifty-one million, six hundred eighty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •