Base | Representation |
---|---|
bin | 11000011001110001… |
… | …01111001111000100 |
3 | 1020211001000221100202 |
4 | 30030320233033010 |
5 | 203312340231040 |
6 | 10004002030032 |
7 | 642441346466 |
oct | 141470571704 |
9 | 36731027322 |
10 | 13101102020 |
11 | 5613259946 |
12 | 2657648318 |
13 | 130a30cc96 |
14 | 8c3d66136 |
15 | 51a273015 |
hex | 30ce2f3c4 |
13101102020 has 48 divisors (see below), whose sum is σ = 29147610240. Its totient is φ = 4929314304.
The previous prime is 13101102019. The next prime is 13101102083. The reversal of 13101102020 is 2020110131.
13101102020 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 13101101992 and 13101102010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 628607 + ... + 649113.
It is an arithmetic number, because the mean of its divisors is an integer number (607241880).
Almost surely, 213101102020 is an apocalyptic number.
13101102020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13101102020 is an abundant number, since it is smaller than the sum of its proper divisors (16046508220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13101102020 is a wasteful number, since it uses less digits than its factorization.
13101102020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22412 (or 22410 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 13101102020 its reverse (2020110131), we get a palindrome (15121212151).
The spelling of 13101102020 in words is "thirteen billion, one hundred one million, one hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •