Base | Representation |
---|---|
bin | 1010001101101101… |
… | …01001101000000000 |
3 | 112011011112202102102 |
4 | 11012312221220000 |
5 | 42212311324223 |
6 | 2304050405532 |
7 | 252614445506 |
oct | 50666515000 |
9 | 15134482372 |
10 | 5483698688 |
11 | 236444aa96 |
12 | 10905908a8 |
13 | 695126c30 |
14 | 3a0412676 |
15 | 22164e928 |
hex | 146da9a00 |
5483698688 has 80 divisors (see below), whose sum is σ = 11933376840. Its totient is φ = 2502230016.
The previous prime is 5483698643. The next prime is 5483698723. The reversal of 5483698688 is 8868963845.
It can be written as a sum of positive squares in 4 ways, for example, as 1495523584 + 3988175104 = 38672^2 + 63152^2 .
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 7 ways as a sum of consecutive naturals, for example, 587756 + ... + 597012.
Almost surely, 25483698688 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 5483698688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5966688420).
5483698688 is an abundant number, since it is smaller than the sum of its proper divisors (6449678152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5483698688 is an equidigital number, since it uses as much as digits as its factorization.
5483698688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9377 (or 9361 counting only the distinct ones).
The product of its digits is 79626240, while the sum is 65.
The square root of 5483698688 is about 74051.9998919678. Note that the first 3 decimals coincide. The cubic root of 5483698688 is about 1763.4285234265.
The spelling of 5483698688 in words is "five billion, four hundred eighty-three million, six hundred ninety-eight thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •