Base | Representation |
---|---|
bin | 10010000010010… |
… | …10011110100001 |
3 | 101112200211120202 |
4 | 21001022132201 |
5 | 302213100001 |
6 | 23002514545 |
7 | 3515012606 |
oct | 1101123641 |
9 | 345624522 |
10 | 151300001 |
11 | 7844aa26 |
12 | 42805a55 |
13 | 25465838 |
14 | 161466ad |
15 | d43996b |
hex | 904a7a1 |
151300001 has 4 divisors (see below), whose sum is σ = 154154772. Its totient is φ = 148445232.
The previous prime is 151299997. The next prime is 151300027. The reversal of 151300001 is 100003151.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 126787600 + 24512401 = 11260^2 + 4951^2 .
It is a cyclic number.
It is not a de Polignac number, because 151300001 - 22 = 151299997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (151300081) 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 in 3 ways as a sum of consecutive naturals, for example, 1427306 + ... + 1427411.
It is an arithmetic number, because the mean of its divisors is an integer number (38538693).
Almost surely, 2151300001 is an apocalyptic number.
It is an amenable number.
151300001 is a deficient number, since it is larger than the sum of its proper divisors (2854771).
151300001 is an equidigital number, since it uses as much as digits as its factorization.
151300001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2854770.
The product of its (nonzero) digits is 15, while the sum is 11.
The square root of 151300001 is about 12300.4065379970. The cubic root of 151300001 is about 532.8598239560.
Adding to 151300001 its reverse (100003151), we get a palindrome (251303152).
The spelling of 151300001 in words is "one hundred fifty-one million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •