Base | Representation |
---|---|
bin | 10001110010110… |
… | …11000100110001 |
3 | 101101212202002101 |
4 | 20321123010301 |
5 | 301203131313 |
6 | 22451220401 |
7 | 3461531635 |
oct | 1071330461 |
9 | 341782071 |
10 | 149270833 |
11 | 77294428 |
12 | 41ba7701 |
13 | 24c0504a |
14 | 15b78dc5 |
15 | d1885dd |
hex | 8e5b131 |
149270833 has 2 divisors, whose sum is σ = 149270834. Its totient is φ = 149270832.
The previous prime is 149270831. The next prime is 149270861. The reversal of 149270833 is 338072941.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 128777104 + 20493729 = 11348^2 + 4527^2 .
It is a cyclic number.
It is not a de Polignac number, because 149270833 - 21 = 149270831 is a prime.
It is a super-3 number, since 3×1492708333 (a number of 25 digits) contains 333 as substring.
Together with 149270831, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 149270792 and 149270801.
It is not a weakly prime, because it can be changed into another prime (149270831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74635416 + 74635417.
It is an arithmetic number, because the mean of its divisors is an integer number (74635417).
Almost surely, 2149270833 is an apocalyptic number.
It is an amenable number.
149270833 is a deficient number, since it is larger than the sum of its proper divisors (1).
149270833 is an equidigital number, since it uses as much as digits as its factorization.
149270833 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 37.
The square root of 149270833 is about 12217.6443310484. The cubic root of 149270833 is about 530.4669351288.
The spelling of 149270833 in words is "one hundred forty-nine million, two hundred seventy thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •