Base | Representation |
---|---|
bin | 11000011101001110… |
… | …00011110010000100 |
3 | 1020220001110020010212 |
4 | 30032213003302010 |
5 | 203342241201040 |
6 | 10010513534552 |
7 | 643242226403 |
oct | 141647036204 |
9 | 36801406125 |
10 | 13130022020 |
11 | 5628611975 |
12 | 2665274458 |
13 | 13132c74cb |
14 | 8c7b3363a |
15 | 51ca86d65 |
hex | 30e9c3c84 |
13130022020 has 48 divisors (see below), whose sum is σ = 29294803440. Its totient is φ = 4933845504.
The previous prime is 13130022011. The next prime is 13130022023. The reversal of 13130022020 is 2022003131.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 87011584 + 13043010436 = 9328^2 + 114206^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13130021986 and 13130022004.
It is not an unprimeable number, because it can be changed into a prime (13130022023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 284459 + ... + 327378.
It is an arithmetic number, because the mean of its divisors is an integer number (610308405).
Almost surely, 213130022020 is an apocalyptic number.
13130022020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13130022020 is an abundant number, since it is smaller than the sum of its proper divisors (16164781420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13130022020 is a wasteful number, since it uses less digits than its factorization.
13130022020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 611912 (or 611910 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 13130022020 its reverse (2022003131), we get a palindrome (15152025151).
The spelling of 13130022020 in words is "thirteen billion, one hundred thirty million, twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •