Base | Representation |
---|---|
bin | 110001100100110… |
… | …0100000110100000 |
3 | 11021221002002112202 |
4 | 1203021210012200 |
5 | 11401320422202 |
6 | 433021312332 |
7 | 56136050660 |
oct | 14311440640 |
9 | 4257062482 |
10 | 1663451552 |
11 | 783a7a854 |
12 | 3a51056a8 |
13 | 206820a79 |
14 | 11acd01a0 |
15 | 9b084802 |
hex | 632641a0 |
1663451552 has 48 divisors (see below), whose sum is σ = 3759662592. Its totient is φ = 709689600.
The previous prime is 1663451527. The next prime is 1663451567. The reversal of 1663451552 is 2551543661.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33302 + ... + 66602.
It is an arithmetic number, because the mean of its divisors is an integer number (78326304).
Almost surely, 21663451552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1663451552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1879831296).
1663451552 is an abundant number, since it is smaller than the sum of its proper divisors (2096211040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1663451552 is a wasteful number, since it uses less digits than its factorization.
1663451552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33541 (or 33533 counting only the distinct ones).
The product of its digits is 108000, while the sum is 38.
The square root of 1663451552 is about 40785.4330858457. The cubic root of 1663451552 is about 1184.8682227489.
It can be divided in two parts, 16634 and 51552, that added together give a palindrome (68186).
The spelling of 1663451552 in words is "one billion, six hundred sixty-three million, four hundred fifty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •