Base | Representation |
---|---|
bin | 11001000111001111… |
… | …11110111101000000 |
3 | 1021210121212022220002 |
4 | 30203213332331000 |
5 | 210103020222140 |
6 | 10105510335132 |
7 | 655053042446 |
oct | 144347767500 |
9 | 37717768802 |
10 | 13482585920 |
11 | 57996283a1 |
12 | 274335a4a8 |
13 | 136b36a6bb |
14 | 91c8aab96 |
15 | 53d9ca415 |
hex | 3239fef40 |
13482585920 has 42 divisors (see below), whose sum is σ = 32110354626. Its totient is φ = 5392203520.
The previous prime is 13482585871. The next prime is 13482585923. The reversal of 13482585920 is 2958528431.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 10786068736 + 2696517184 = 103856^2 + 51928^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13482585923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2073875 + ... + 2080365.
It is an arithmetic number, because the mean of its divisors is an integer number (764532253).
Almost surely, 213482585920 is an apocalyptic number.
13482585920 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13482585920 is an abundant number, since it is smaller than the sum of its proper divisors (18627768706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13482585920 is an frugal number, since it uses more digits than its factorization.
13482585920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12999 (or 6498 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 47.
The spelling of 13482585920 in words is "thirteen billion, four hundred eighty-two million, five hundred eighty-five thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •