Base | Representation |
---|---|
bin | 11001000011110110… |
… | …01001000010010000 |
3 | 1021201122011201210112 |
4 | 30201323021002100 |
5 | 210023214203040 |
6 | 10103011020452 |
7 | 654255365555 |
oct | 144173110220 |
9 | 37648151715 |
10 | 13454053520 |
11 | 578450a5a6 |
12 | 273589a728 |
13 | 136548a71b |
14 | 918ba0a2c |
15 | 53b241365 |
hex | 321ec9090 |
13454053520 has 80 divisors (see below), whose sum is σ = 34062552000. Its totient is φ = 4922555904.
The previous prime is 13454053513. The next prime is 13454053531. The reversal of 13454053520 is 2535045431.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×134540535202 (a number of 21 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 108530 + ... + 196689.
It is an arithmetic number, because the mean of its divisors is an integer number (425781900).
Almost surely, 213454053520 is an apocalyptic number.
13454053520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13454053520 is an abundant number, since it is smaller than the sum of its proper divisors (20608498480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13454053520 is a wasteful number, since it uses less digits than its factorization.
13454053520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305280 (or 305274 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 32.
Adding to 13454053520 its reverse (2535045431), we get a palindrome (15989098951).
The spelling of 13454053520 in words is "thirteen billion, four hundred fifty-four million, fifty-three thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •