Base | Representation |
---|---|
bin | 101101101110110110… |
… | …011100011010000001 |
3 | 11200202011121021211002 |
4 | 231232312130122001 |
5 | 1301031211444040 |
6 | 34320325501345 |
7 | 3355565364644 |
oct | 555666343201 |
9 | 150664537732 |
10 | 49104406145 |
11 | 19909180143 |
12 | 9624b71855 |
13 | 4827359a32 |
14 | 253b7dda5b |
15 | 1425e38a15 |
hex | b6ed9c681 |
49104406145 has 16 divisors (see below), whose sum is σ = 59394962880. Its totient is φ = 38970609600.
The previous prime is 49104406129. The next prime is 49104406159. The reversal of 49104406145 is 54160440194.
It is a happy number.
It is not a de Polignac number, because 49104406145 - 24 = 49104406129 is a prime.
It is a super-2 number, since 2×491044061452 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 49104406099 and 49104406108.
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 15 ways as a sum of consecutive naturals, for example, 2261390 + ... + 2283000.
It is an arithmetic number, because the mean of its divisors is an integer number (3712185180).
Almost surely, 249104406145 is an apocalyptic number.
It is an amenable number.
49104406145 is a deficient number, since it is larger than the sum of its proper divisors (10290556735).
49104406145 is a wasteful number, since it uses less digits than its factorization.
49104406145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25216.
The product of its (nonzero) digits is 69120, while the sum is 38.
The spelling of 49104406145 in words is "forty-nine billion, one hundred four million, four hundred six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •