Base | Representation |
---|---|
bin | 10010000010011… |
… | …00001010100001 |
3 | 101112201012001202 |
4 | 21001030022201 |
5 | 302213310123 |
6 | 23003010545 |
7 | 3515042012 |
oct | 1101141241 |
9 | 345635052 |
10 | 151306913 |
11 | 7845513a |
12 | 42809a55 |
13 | 25468a24 |
14 | 16149009 |
15 | d43ba28 |
hex | 904c2a1 |
151306913 has 2 divisors, whose sum is σ = 151306914. Its totient is φ = 151306912.
The previous prime is 151306879. The next prime is 151306931. The reversal of 151306913 is 319603151.
Together with next prime (151306931) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 149989009 + 1317904 = 12247^2 + 1148^2 .
It is a cyclic number.
It is not a de Polignac number, because 151306913 - 26 = 151306849 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (151306943) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75653456 + 75653457.
It is an arithmetic number, because the mean of its divisors is an integer number (75653457).
Almost surely, 2151306913 is an apocalyptic number.
It is an amenable number.
151306913 is a deficient number, since it is larger than the sum of its proper divisors (1).
151306913 is an equidigital number, since it uses as much as digits as its factorization.
151306913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2430, while the sum is 29.
The square root of 151306913 is about 12300.6875011115. The cubic root of 151306913 is about 532.8679382344.
The spelling of 151306913 in words is "one hundred fifty-one million, three hundred six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •