Base | Representation |
---|---|
bin | 10001110010111… |
… | …00100011100101 |
3 | 101101220001102010 |
4 | 20321130203211 |
5 | 301203330101 |
6 | 22451304433 |
7 | 3461555424 |
oct | 1071344345 |
9 | 341801363 |
10 | 149276901 |
11 | 77298a44 |
12 | 41bab119 |
13 | 24c07a37 |
14 | 15b7b2bb |
15 | d18a2d6 |
hex | 8e5c8e5 |
149276901 has 8 divisors (see below), whose sum is σ = 209511520. Its totient is φ = 94280112.
The previous prime is 149276887. The next prime is 149276909. The reversal of 149276901 is 109672941.
149276901 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 149276901 - 26 = 149276837 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 149276901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (149276909) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1309390 + ... + 1309503.
It is an arithmetic number, because the mean of its divisors is an integer number (26188940).
Almost surely, 2149276901 is an apocalyptic number.
It is an amenable number.
149276901 is a deficient number, since it is larger than the sum of its proper divisors (60234619).
149276901 is a wasteful number, since it uses less digits than its factorization.
149276901 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2618915.
The product of its (nonzero) digits is 27216, while the sum is 39.
The square root of 149276901 is about 12217.8926579014. The cubic root of 149276901 is about 530.4741230249.
The spelling of 149276901 in words is "one hundred forty-nine million, two hundred seventy-six thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •