Base | Representation |
---|---|
bin | 10010000011000… |
… | …10110011100001 |
3 | 101112212220021102 |
4 | 21001202303201 |
5 | 302224242044 |
6 | 23005004145 |
7 | 3515606252 |
oct | 1101426341 |
9 | 345786242 |
10 | 151399649 |
11 | 78508885 |
12 | 42853655 |
13 | 2549bcbb |
14 | 16170b29 |
15 | d45924e |
hex | 9062ce1 |
151399649 has 4 divisors (see below), whose sum is σ = 151446036. Its totient is φ = 151353264.
The previous prime is 151399601. The next prime is 151399663. The reversal of 151399649 is 946993151.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 946993151 = 13 ⋅72845627.
It can be written as a sum of positive squares in 2 ways, for example, as 143520400 + 7879249 = 11980^2 + 2807^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151399649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151399679) 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, 17894 + ... + 24959.
It is an arithmetic number, because the mean of its divisors is an integer number (37861509).
Almost surely, 2151399649 is an apocalyptic number.
It is an amenable number.
151399649 is a deficient number, since it is larger than the sum of its proper divisors (46387).
151399649 is an equidigital number, since it uses as much as digits as its factorization.
151399649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46386.
The product of its digits is 262440, while the sum is 47.
The square root of 151399649 is about 12304.4564691009. The cubic root of 151399649 is about 532.9767809125.
The spelling of 151399649 in words is "one hundred fifty-one million, three hundred ninety-nine thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •