Base | Representation |
---|---|
bin | 101101101001001110… |
… | …101100011110100100 |
3 | 11200111121011001021210 |
4 | 231221032230132210 |
5 | 1300333041201012 |
6 | 34303120311420 |
7 | 3353341656210 |
oct | 555116543644 |
9 | 150447131253 |
10 | 49010100132 |
11 | 1986aa18694 |
12 | 95b9472570 |
13 | 481095ab66 |
14 | 252d091940 |
15 | 141ca0b23c |
hex | b693ac7a4 |
49010100132 has 48 divisors (see below), whose sum is σ = 134909530112. Its totient is φ = 13551179040.
The previous prime is 49010100131. The next prime is 49010100157. The reversal of 49010100132 is 23100101094.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 49010100099 and 49010100108.
It is not an unprimeable number, because it can be changed into a prime (49010100131) 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 15 ways as a sum of consecutive naturals, for example, 9407938 + ... + 9413145.
Almost surely, 249010100132 is an apocalyptic number.
49010100132 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
49010100132 is an abundant number, since it is smaller than the sum of its proper divisors (85899429980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49010100132 is a wasteful number, since it uses less digits than its factorization.
49010100132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18821128 (or 18821126 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
The spelling of 49010100132 in words is "forty-nine billion, ten million, one hundred thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •