Base | Representation |
---|---|
bin | 11000010000010110… |
… | …01001100100110100 |
3 | 1020121112021021222102 |
4 | 30020023021210310 |
5 | 203132120324140 |
6 | 5552055321232 |
7 | 640461351152 |
oct | 141013114464 |
9 | 36545237872 |
10 | 13022042420 |
11 | 5582670232 |
12 | 2635080218 |
13 | 12c6b1b95a |
14 | 8b76663d2 |
15 | 513357e15 |
hex | 3082c9934 |
13022042420 has 48 divisors (see below), whose sum is σ = 27978263040. Its totient is φ = 5089803264.
The previous prime is 13022042399. The next prime is 13022042443. The reversal of 13022042420 is 2424022031.
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 = 13022042392 and 13022042401.
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, 110777 + ... + 195743.
It is an arithmetic number, because the mean of its divisors is an integer number (582880480).
Almost surely, 213022042420 is an apocalyptic number.
13022042420 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13022042420 is an abundant number, since it is smaller than the sum of its proper divisors (14956220620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13022042420 is a wasteful number, since it uses less digits than its factorization.
13022042420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85152 (or 85150 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 20.
Adding to 13022042420 its reverse (2424022031), we get a palindrome (15446064451).
The spelling of 13022042420 in words is "thirteen billion, twenty-two million, forty-two thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •