Base | Representation |
---|---|
bin | 1101000011100110100… |
… | …01101001111001000000 |
3 | 1120212221110000001020221 |
4 | 12201303101221321000 |
5 | 24322223303403111 |
6 | 542031110112424 |
7 | 44260663145212 |
oct | 6416321517100 |
9 | 1525843001227 |
10 | 448610606656 |
11 | 163288aa0693 |
12 | 72b3a94b714 |
13 | 333c45a4314 |
14 | 179da1825b2 |
15 | ba092e1371 |
hex | 6873469e40 |
448610606656 has 63 divisors (see below), whose sum is σ = 922286604369. Its totient is φ = 216495621888.
The previous prime is 448610606617. The next prime is 448610606663. The reversal of 448610606656 is 656606016844.
It is a happy number.
The square root of 448610606656 is 669784.
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., 235240520256 + 213370086400 = 485016^2 + 461920^2 .
It is a Duffinian number.
It is an unprimeable number.
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, 155388445 + ... + 155391331.
Almost surely, 2448610606656 is an apocalyptic number.
448610606656 is the 669784-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 448610606656
448610606656 is an abundant number, since it is smaller than the sum of its proper divisors (473675997713).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
448610606656 is an frugal number, since it uses more digits than its factorization.
448610606656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5844 (or 2918 counting only the distinct ones).
The product of its (nonzero) digits is 4976640, while the sum is 52.
The spelling of 448610606656 in words is "four hundred forty-eight billion, six hundred ten million, six hundred six thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •