Base | Representation |
---|---|
bin | 11001001101000010… |
… | …11100000111100100 |
3 | 1021221000100021122101 |
4 | 30212201130013210 |
5 | 210202441431040 |
6 | 10114404341444 |
7 | 656213214400 |
oct | 144641340744 |
9 | 37830307571 |
10 | 13531202020 |
11 | 5814013396 |
12 | 27576a4884 |
13 | 137845cc1b |
14 | 925124100 |
15 | 542dd009a |
hex | 32685c1e4 |
13531202020 has 144 divisors (see below), whose sum is σ = 35107914240. Its totient is φ = 4352818176.
The previous prime is 13531201951. The next prime is 13531202029. The reversal of 13531202020 is 2020213531.
It is not an unprimeable number, because it can be changed into a prime (13531202029) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6313069 + ... + 6315211.
It is an arithmetic number, because the mean of its divisors is an integer number (243804960).
Almost surely, 213531202020 is an apocalyptic number.
13531202020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13531202020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17553957120).
13531202020 is an abundant number, since it is smaller than the sum of its proper divisors (21576712220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13531202020 is a wasteful number, since it uses less digits than its factorization.
13531202020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2562 (or 2553 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 19.
Adding to 13531202020 its reverse (2020213531), we get a palindrome (15551415551).
The spelling of 13531202020 in words is "thirteen billion, five hundred thirty-one million, two hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •