Base | Representation |
---|---|
bin | 11000101010100101… |
… | …01010000101111000 |
3 | 1021011212101010000101 |
4 | 30111102222011320 |
5 | 204104440130144 |
6 | 10030000245144 |
7 | 646103054410 |
oct | 142522520570 |
9 | 37155333011 |
10 | 13242114424 |
11 | 5685912620 |
12 | 26969107b4 |
13 | 13305b3086 |
14 | 8d8991640 |
15 | 5278296d4 |
hex | 3154aa178 |
13242114424 has 32 divisors (see below), whose sum is σ = 30955593600. Its totient is φ = 5159265120.
The previous prime is 13242114367. The next prime is 13242114427. The reversal of 13242114424 is 42441124231.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 13242114392 and 13242114401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13242114427) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10747854 + ... + 10749085.
It is an arithmetic number, because the mean of its divisors is an integer number (967362300).
Almost surely, 213242114424 is an apocalyptic number.
13242114424 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
13242114424 is an abundant number, since it is smaller than the sum of its proper divisors (17713479176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13242114424 is a wasteful number, since it uses less digits than its factorization.
13242114424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21496963 (or 21496959 counting only the distinct ones).
The product of its digits is 6144, while the sum is 28.
Adding to 13242114424 its reverse (42441124231), we get a palindrome (55683238655).
The spelling of 13242114424 in words is "thirteen billion, two hundred forty-two million, one hundred fourteen thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •