Base | Representation |
---|---|
bin | 101110000100010000… |
… | …011011011000010000 |
3 | 11201200012101010202221 |
4 | 232010100123120100 |
5 | 1302300131223331 |
6 | 34420115150424 |
7 | 3400516101100 |
oct | 560420333020 |
9 | 151605333687 |
10 | 49463539216 |
11 | 19a82973133 |
12 | 97052a5414 |
13 | 4883890000 |
14 | 25733a7200 |
15 | 1447728711 |
hex | b8441b610 |
49463539216 has 225 divisors, whose sum is σ = 123396389979. Its totient is φ = 19151653248.
The previous prime is 49463539183. The next prime is 49463539243. The reversal of 49463539216 is 61293536494.
The square root of 49463539216 is 222404.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 24524812816 + 24938726400 = 156604^2 + 157920^2 .
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 1052415705 + ... + 1052415751.
Almost surely, 249463539216 is an apocalyptic number.
49463539216 is the 222404-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 49463539216
49463539216 is an abundant number, since it is smaller than the sum of its proper divisors (73932850763).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49463539216 is an frugal number, since it uses more digits than its factorization.
49463539216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168 (or 69 counting only the distinct ones).
The product of its digits is 4199040, while the sum is 52.
The spelling of 49463539216 in words is "forty-nine billion, four hundred sixty-three million, five hundred thirty-nine thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •