Base | Representation |
---|---|
bin | 10010000010011… |
… | …00001011110001 |
3 | 101112201012011201 |
4 | 21001030023301 |
5 | 302213310433 |
6 | 23003011201 |
7 | 3515042155 |
oct | 1101141361 |
9 | 345635151 |
10 | 151306993 |
11 | 78455202 |
12 | 42809b01 |
13 | 25468a86 |
14 | 16149065 |
15 | d43ba7d |
hex | 904c2f1 |
151306993 has 2 divisors, whose sum is σ = 151306994. Its totient is φ = 151306992.
The previous prime is 151306973. The next prime is 151307029. The reversal of 151306993 is 399603151.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115928289 + 35378704 = 10767^2 + 5948^2 .
It is a cyclic number.
It is not a de Polignac number, because 151306993 - 213 = 151298801 is a prime.
It is a super-2 number, since 2×1513069932 = 45787612261404098, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (151306913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75653496 + 75653497.
It is an arithmetic number, because the mean of its divisors is an integer number (75653497).
Almost surely, 2151306993 is an apocalyptic number.
It is an amenable number.
151306993 is a deficient number, since it is larger than the sum of its proper divisors (1).
151306993 is an equidigital number, since it uses as much as digits as its factorization.
151306993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21870, while the sum is 37.
The square root of 151306993 is about 12300.6907529618. The cubic root of 151306993 is about 532.8680321482.
The spelling of 151306993 in words is "one hundred fifty-one million, three hundred six thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •