Base | Representation |
---|---|
bin | 111100000101011… |
… | …1010010000110001 |
3 | 12012111200210221101 |
4 | 1320022322100301 |
5 | 13112112013001 |
6 | 532020324401 |
7 | 100650534241 |
oct | 17012722061 |
9 | 5174623841 |
10 | 2016126001 |
11 | 94506133a |
12 | 483243701 |
13 | 261902386 |
14 | 151a95b21 |
15 | bbeeaa01 |
hex | 782ba431 |
2016126001 has 4 divisors (see below), whose sum is σ = 2016228852. Its totient is φ = 2016023152.
The previous prime is 2016125987. The next prime is 2016126031. The reversal of 2016126001 is 1006216102.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 480661776 + 1535464225 = 21924^2 + 39185^2 .
It is a cyclic number.
It is not a de Polignac number, because 2016126001 - 223 = 2007737393 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2016126001.
It is not an unprimeable number, because it can be changed into a prime (2016126031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11890 + ... + 64603.
It is an arithmetic number, because the mean of its divisors is an integer number (504057213).
Almost surely, 22016126001 is an apocalyptic number.
It is an amenable number.
2016126001 is a deficient number, since it is larger than the sum of its proper divisors (102851).
2016126001 is an equidigital number, since it uses as much as digits as its factorization.
2016126001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102850.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 2016126001 is about 44901.2917520198. The cubic root of 2016126001 is about 1263.2982373569.
The spelling of 2016126001 in words is "two billion, sixteen million, one hundred twenty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •