Base | Representation |
---|---|
bin | 11001001001111011… |
… | …00100001000001000 |
3 | 1021212012002010020122 |
4 | 30210331210020020 |
5 | 210124241123144 |
6 | 10112031242412 |
7 | 655444531250 |
oct | 144475441010 |
9 | 37765063218 |
10 | 13505020424 |
11 | 5800260805 |
12 | 274a979408 |
13 | 1372bc3c5c |
14 | 92186a960 |
15 | 54095c7ee |
hex | 324f64208 |
13505020424 has 32 divisors (see below), whose sum is σ = 29721478080. Its totient is φ = 5631436224.
The previous prime is 13505020379. The next prime is 13505020427. The reversal of 13505020424 is 42402050531.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 13505020393 and 13505020402.
It is not an unprimeable number, because it can be changed into a prime (13505020427) by changing a digit.
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, 3256862 + ... + 3261005.
It is an arithmetic number, because the mean of its divisors is an integer number (928796190).
Almost surely, 213505020424 is an apocalyptic number.
13505020424 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
13505020424 is an abundant number, since it is smaller than the sum of its proper divisors (16216457656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13505020424 is a wasteful number, since it uses less digits than its factorization.
13505020424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6517917 (or 6517913 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 26.
Adding to 13505020424 its reverse (42402050531), we get a palindrome (55907070955).
The spelling of 13505020424 in words is "thirteen billion, five hundred five million, twenty thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •