Base | Representation |
---|---|
bin | 10001111101101… |
… | …11111111101101 |
3 | 101111120100112222 |
4 | 20332313333231 |
5 | 302034400023 |
6 | 22542005125 |
7 | 3506633432 |
oct | 1076677755 |
9 | 344510488 |
10 | 150700013 |
11 | 78080172 |
12 | 425767a5 |
13 | 252b5709 |
14 | 1602bb89 |
15 | d36bcc8 |
hex | 8fb7fed |
150700013 has 2 divisors, whose sum is σ = 150700014. Its totient is φ = 150700012.
The previous prime is 150700003. The next prime is 150700027. The reversal of 150700013 is 310007051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 138603529 + 12096484 = 11773^2 + 3478^2 .
It is an emirp because it is prime and its reverse (310007051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 150700013 - 26 = 150699949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 150699964 and 150700000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150700003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75350006 + 75350007.
It is an arithmetic number, because the mean of its divisors is an integer number (75350007).
Almost surely, 2150700013 is an apocalyptic number.
It is an amenable number.
150700013 is a deficient number, since it is larger than the sum of its proper divisors (1).
150700013 is an equidigital number, since it uses as much as digits as its factorization.
150700013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105, while the sum is 17.
The square root of 150700013 is about 12275.9933610279. The cubic root of 150700013 is about 532.1545297510.
Adding to 150700013 its reverse (310007051), we get a palindrome (460707064).
The spelling of 150700013 in words is "one hundred fifty million, seven hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •