Base | Representation |
---|---|
bin | 101101001110110100… |
… | …000010001101011001 |
3 | 11122100201012022222221 |
4 | 231032310002031121 |
5 | 1243431111404031 |
6 | 34151125144041 |
7 | 3336350604154 |
oct | 551664021531 |
9 | 148321168887 |
10 | 48566903641 |
11 | 196628295a3 |
12 | 94b4b5b021 |
13 | 476cba3b09 |
14 | 24ca284c9b |
15 | 13e3b63a11 |
hex | b4ed02359 |
48566903641 has 9 divisors (see below), whose sum is σ = 50191176063. Its totient is φ = 46993617960.
The previous prime is 48566903621. The next prime is 48566903647. The reversal of 48566903641 is 14630966584.
It is a happy number.
The square root of 48566903641 is 220379.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 6959063241 + 41607840400 = 83421^2 + 203980^2 .
It is a de Polignac number, because none of the positive numbers 2k-48566903641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48566903647) 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 8 ways as a sum of consecutive naturals, for example, 6828195 + ... + 6835303.
Almost surely, 248566903641 is an apocalyptic number.
48566903641 is the 220379-th square number.
48566903641 is the 110190-th centered octagonal number.
It is an amenable number.
48566903641 is a deficient number, since it is larger than the sum of its proper divisors (1624272422).
48566903641 is an frugal number, since it uses more digits than its factorization.
48566903641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14280 (or 7140 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 52.
The spelling of 48566903641 in words is "forty-eight billion, five hundred sixty-six million, nine hundred three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •