Base | Representation |
---|---|
bin | 1011101101111… |
… | …1110010101111 |
3 | 10102111010201000 |
4 | 2323133302233 |
5 | 100040314101 |
6 | 4513251343 |
7 | 1134530550 |
oct | 273376257 |
9 | 112433630 |
10 | 49151151 |
11 | 25820a95 |
12 | 14563b53 |
13 | a24bc2a |
14 | 6756327 |
15 | 44ad486 |
hex | 2edfcaf |
49151151 has 32 divisors (see below), whose sum is σ = 85913600. Its totient is φ = 27177120.
The previous prime is 49151149. The next prime is 49151191. The reversal of 49151151 is 15115194.
It is not a de Polignac number, because 49151151 - 21 = 49151149 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49151101) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 1665 + ... + 10053.
It is an arithmetic number, because the mean of its divisors is an integer number (2684800).
Almost surely, 249151151 is an apocalyptic number.
49151151 is a deficient number, since it is larger than the sum of its proper divisors (36762449).
49151151 is a wasteful number, since it uses less digits than its factorization.
49151151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8436 (or 8430 counting only the distinct ones).
The product of its digits is 900, while the sum is 27.
The square root of 49151151 is about 7010.7881867876. The cubic root of 49151151 is about 366.3064485286.
The spelling of 49151151 in words is "forty-nine million, one hundred fifty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •