Base | Representation |
---|---|
bin | 111100011011001… |
… | …1000000000000001 |
3 | 12020022010200120101 |
4 | 1320312120000001 |
5 | 13123021120001 |
6 | 533104442401 |
7 | 101146431013 |
oct | 17066300001 |
9 | 5208120511 |
10 | 2027520001 |
11 | 950533871 |
12 | 487019401 |
13 | 2640915a0 |
14 | 1533c01b3 |
15 | bceeba01 |
hex | 78d98001 |
2027520001 has 16 divisors (see below), whose sum is σ = 2372554240. Its totient is φ = 1715852160.
The previous prime is 2027519993. The next prime is 2027520017. The reversal of 2027520001 is 1000257202.
It is a cyclic number.
It is not a de Polignac number, because 2027520001 - 23 = 2027519993 is a prime.
It is a super-2 number, since 2×20275200012 = 8221674708910080002, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2027520041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 124740 + ... + 140053.
It is an arithmetic number, because the mean of its divisors is an integer number (148284640).
Almost surely, 22027520001 is an apocalyptic number.
It is an amenable number.
2027520001 is a deficient number, since it is larger than the sum of its proper divisors (345034239).
2027520001 is a wasteful number, since it uses less digits than its factorization.
2027520001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264856.
The product of its (nonzero) digits is 280, while the sum is 19.
The square root of 2027520001 is about 45027.9913054091. The cubic root of 2027520001 is about 1265.6735831625.
Adding to 2027520001 its reverse (1000257202), we get a palindrome (3027777203).
The spelling of 2027520001 in words is "two billion, twenty-seven million, five hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •