Base | Representation |
---|---|
bin | 11000111101111000… |
… | …01101011011100100 |
3 | 1021121010222212001021 |
4 | 30132330031123210 |
5 | 204422411031040 |
6 | 10054022140524 |
7 | 653110065043 |
oct | 143674153344 |
9 | 37533885037 |
10 | 13404002020 |
11 | 5759234122 |
12 | 2720b81744 |
13 | 1357cb4a56 |
14 | 91229255a |
15 | 536b5624a |
hex | 31ef0d6e4 |
13404002020 has 12 divisors (see below), whose sum is σ = 28148404284. Its totient is φ = 5361600800.
The previous prime is 13404001993. The next prime is 13404002069. The reversal of 13404002020 is 2020040431.
It can be written as a sum of positive squares in 2 ways, for example, as 6811861156 + 6592140864 = 82534^2 + 81192^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13404001985 and 13404002003.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 335100031 + ... + 335100070.
It is an arithmetic number, because the mean of its divisors is an integer number (2345700357).
Almost surely, 213404002020 is an apocalyptic number.
13404002020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13404002020 is an abundant number, since it is smaller than the sum of its proper divisors (14744402264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13404002020 is a wasteful number, since it uses less digits than its factorization.
13404002020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670200110 (or 670200108 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 16.
Adding to 13404002020 its reverse (2020040431), we get a palindrome (15424042451).
The spelling of 13404002020 in words is "thirteen billion, four hundred four million, two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •