Base | Representation |
---|---|
bin | 10010101000001011… |
… | …101101111111100001 |
3 | 1220121221101011022010 |
4 | 102220023231333201 |
5 | 311430341412231 |
6 | 13104421503133 |
7 | 1305441026160 |
oct | 225013557741 |
9 | 56557334263 |
10 | 20001513441 |
11 | 85343730a8 |
12 | 3a62571aa9 |
13 | 1b69ab7770 |
14 | d7a59b3d7 |
15 | 7c0e69546 |
hex | 4a82edfe1 |
20001513441 has 64 divisors (see below), whose sum is σ = 33941569536. Its totient is φ = 10191916800.
The previous prime is 20001513401. The next prime is 20001513449. The reversal of 20001513441 is 14431510002.
It is not a de Polignac number, because 20001513441 - 29 = 20001512929 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (20001513449) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 5727706 + ... + 5731196.
It is an arithmetic number, because the mean of its divisors is an integer number (530337024).
Almost surely, 220001513441 is an apocalyptic number.
20001513441 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20001513441 is a deficient number, since it is larger than the sum of its proper divisors (13940056095).
20001513441 is a wasteful number, since it uses less digits than its factorization.
20001513441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4222.
The product of its (nonzero) digits is 480, while the sum is 21.
The spelling of 20001513441 in words is "twenty billion, one million, five hundred thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •