Base | Representation |
---|---|
bin | 11101010001110101101… |
… | …111010000011000111101 |
3 | 21010100101010121222001211 |
4 | 131101311233100120331 |
5 | 230431104111013301 |
6 | 4140150443404421 |
7 | 265235505650362 |
oct | 35216557203075 |
9 | 7110333558054 |
10 | 2012020016701 |
11 | 706324934292 |
12 | 285b39523711 |
13 | 11796a8b6aa6 |
14 | 6d54cddc469 |
15 | 3750d3a4051 |
hex | 1d475bd063d |
2012020016701 has 8 divisors (see below), whose sum is σ = 2070023461184. Its totient is φ = 1954839316320.
The previous prime is 2012020016687. The next prime is 2012020016723. The reversal of 2012020016701 is 1076100202102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2012020016701 - 29 = 2012020016189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012020616701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 205681065 + ... + 205690846.
It is an arithmetic number, because the mean of its divisors is an integer number (258752932648).
Almost surely, 22012020016701 is an apocalyptic number.
It is an amenable number.
2012020016701 is a deficient number, since it is larger than the sum of its proper divisors (58003444483).
2012020016701 is an equidigital number, since it uses as much as digits as its factorization.
2012020016701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411372051.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 2012020016701 its reverse (1076100202102), we get a palindrome (3088120218803).
The spelling of 2012020016701 in words is "two trillion, twelve billion, twenty million, sixteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •