Base | Representation |
---|---|
bin | 101101110001011000… |
… | …110011100000101001 |
3 | 11200212010200122211222 |
4 | 231301120303200221 |
5 | 1301123110434410 |
6 | 34324450031425 |
7 | 3356623223204 |
oct | 556130634051 |
9 | 150763618758 |
10 | 49146968105 |
11 | 19930200614 |
12 | 9637278575 |
13 | 483310c721 |
14 | 254331c93b |
15 | 1429a44955 |
hex | b71633829 |
49146968105 has 8 divisors (see below), whose sum is σ = 60089123592. Its totient is φ = 38575733248.
The previous prime is 49146968083. The next prime is 49146968107. The reversal of 49146968105 is 50186964194.
It can be written as a sum of positive squares in 4 ways, for example, as 1408651024 + 47738317081 = 37532^2 + 218491^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 49146968105 - 228 = 48878532649 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (53).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (49146968107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92729864 + ... + 92730393.
It is an arithmetic number, because the mean of its divisors is an integer number (7511140449).
Almost surely, 249146968105 is an apocalyptic number.
It is an amenable number.
49146968105 is a deficient number, since it is larger than the sum of its proper divisors (10942155487).
49146968105 is a wasteful number, since it uses less digits than its factorization.
49146968105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185460315.
The product of its (nonzero) digits is 1866240, while the sum is 53.
The spelling of 49146968105 in words is "forty-nine billion, one hundred forty-six million, nine hundred sixty-eight thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •