Base | Representation |
---|---|
bin | 10001110101100… |
… | …00000101111101 |
3 | 101102112102210000 |
4 | 20322300011331 |
5 | 301300302234 |
6 | 22502504513 |
7 | 3464512125 |
oct | 1072600575 |
9 | 342472700 |
10 | 149619069 |
11 | 77502026 |
12 | 42135139 |
13 | 24cc76c2 |
14 | 15c29c85 |
15 | d206899 |
hex | 8eb017d |
149619069 has 10 divisors (see below), whose sum is σ = 223505150. Its totient is φ = 99745992.
The previous prime is 149619061. The next prime is 149619073. The reversal of 149619069 is 960916941.
149619069 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 147622500 + 1996569 = 12150^2 + 1413^2 .
It is not a de Polignac number, because 149619069 - 23 = 149619061 is a prime.
It is a super-2 number, since 2×1496190692 = 44771731616853522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (149619061) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 923494 + ... + 923655.
It is an arithmetic number, because the mean of its divisors is an integer number (22350515).
Almost surely, 2149619069 is an apocalyptic number.
It is an amenable number.
149619069 is a deficient number, since it is larger than the sum of its proper divisors (73886081).
149619069 is an equidigital number, since it uses as much as digits as its factorization.
149619069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1847161 (or 1847152 counting only the distinct ones).
The product of its (nonzero) digits is 104976, while the sum is 45.
The square root of 149619069 is about 12231.8873850277. The cubic root of 149619069 is about 530.8791259869.
The spelling of 149619069 in words is "one hundred forty-nine million, six hundred nineteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •