Base | Representation |
---|---|
bin | 10001110110011… |
… | …00111111101111 |
3 | 101102202110011200 |
4 | 20323030333233 |
5 | 301313044310 |
6 | 22505220543 |
7 | 3465514230 |
oct | 1073147757 |
9 | 342673150 |
10 | 149737455 |
11 | 77582a6a |
12 | 42191753 |
13 | 2503955a |
14 | 15c5b087 |
15 | d22b9c0 |
hex | 8eccfef |
149737455 has 48 divisors (see below), whose sum is σ = 302253120. Its totient is φ = 67152384.
The previous prime is 149737433. The next prime is 149737463. The reversal of 149737455 is 554737941.
It is not a de Polignac number, because 149737455 - 212 = 149733359 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 149737455.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 12211 + ... + 21179.
It is an arithmetic number, because the mean of its divisors is an integer number (6296940).
Almost surely, 2149737455 is an apocalyptic number.
149737455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
149737455 is an abundant number, since it is smaller than the sum of its proper divisors (152515665).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149737455 is a wasteful number, since it uses less digits than its factorization.
149737455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9040 (or 9037 counting only the distinct ones).
The product of its digits is 529200, while the sum is 45.
The square root of 149737455 is about 12236.7256649808. The cubic root of 149737455 is about 531.0191083381.
The spelling of 149737455 in words is "one hundred forty-nine million, seven hundred thirty-seven thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •