Base | Representation |
---|---|
bin | 11000001101110001… |
… | …10000001000110100 |
3 | 1020120000121220100102 |
4 | 30012320300020310 |
5 | 203111103124140 |
6 | 5550004333232 |
7 | 640106636330 |
oct | 140670601064 |
9 | 36500556312 |
10 | 13000442420 |
11 | 5571457899 |
12 | 26299a4218 |
13 | 12c24c81a4 |
14 | 8b48427c0 |
15 | 5114dce15 |
hex | 306e30234 |
13000442420 has 48 divisors (see below), whose sum is σ = 31319785728. Its totient is φ = 4440334080.
The previous prime is 13000442369. The next prime is 13000442437. The reversal of 13000442420 is 2424400031.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 13000442392 and 13000442401.
It is a congruent number.
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, 139721 + ... + 213360.
It is an arithmetic number, because the mean of its divisors is an integer number (652495536).
Almost surely, 213000442420 is an apocalyptic number.
13000442420 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13000442420 is an abundant number, since it is smaller than the sum of its proper divisors (18319343308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13000442420 is a wasteful number, since it uses less digits than its factorization.
13000442420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 353360 (or 353358 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 20.
Adding to 13000442420 its reverse (2424400031), we get a palindrome (15424842451).
The spelling of 13000442420 in words is "thirteen billion, four hundred forty-two thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •