Base | Representation |
---|---|
bin | 10010000101001… |
… | …11011011001001 |
3 | 101120102011211012 |
4 | 21002213123021 |
5 | 302312240323 |
6 | 23015013305 |
7 | 3521156552 |
oct | 1102473311 |
9 | 346364735 |
10 | 151680713 |
11 | 7868aa68 |
12 | 4296a235 |
13 | 25569c02 |
14 | 16205329 |
15 | d4b2678 |
hex | 90a76c9 |
151680713 has 2 divisors, whose sum is σ = 151680714. Its totient is φ = 151680712.
The previous prime is 151680707. The next prime is 151680721. The reversal of 151680713 is 317086151.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 148157584 + 3523129 = 12172^2 + 1877^2 .
It is a cyclic number.
It is not a de Polignac number, because 151680713 - 28 = 151680457 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 151680713.
It is not a weakly prime, because it can be changed into another prime (151680773) 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 as a sum of consecutive naturals, namely, 75840356 + 75840357.
It is an arithmetic number, because the mean of its divisors is an integer number (75840357).
Almost surely, 2151680713 is an apocalyptic number.
It is an amenable number.
151680713 is a deficient number, since it is larger than the sum of its proper divisors (1).
151680713 is an equidigital number, since it uses as much as digits as its factorization.
151680713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 32.
The square root of 151680713 is about 12315.8724010928. The cubic root of 151680713 is about 533.3063897413.
The spelling of 151680713 in words is "one hundred fifty-one million, six hundred eighty thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •