Base | Representation |
---|---|
bin | 111011010100111… |
… | …0000000000000001 |
3 | 12010201202210200001 |
4 | 1312221300000001 |
5 | 13034101443001 |
6 | 525310400001 |
7 | 100221203545 |
oct | 16651600001 |
9 | 5121683601 |
10 | 1990656001 |
11 | 931745354 |
12 | 476800001 |
13 | 259555279 |
14 | 14c545a25 |
15 | b9b69001 |
hex | 76a70001 |
1990656001 has 8 divisors (see below), whose sum is σ = 2034005760. Its totient is φ = 1947347808.
The previous prime is 1990655993. The next prime is 1990656007. The reversal of 1990656001 is 1006560991.
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 1990656001 - 23 = 1990655993 is a prime.
It is a super-2 number, since 2×19906560012 = 7925422628634624002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1990656007) 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 7 ways as a sum of consecutive naturals, for example, 98740 + ... + 117178.
It is an arithmetic number, because the mean of its divisors is an integer number (254250720).
It is a Proth number, since it is equal to 30375 ⋅ 216 + 1 and 30375 < 216.
Almost surely, 21990656001 is an apocalyptic number.
It is an amenable number.
1990656001 is a deficient number, since it is larger than the sum of its proper divisors (43349759).
1990656001 is a wasteful number, since it uses less digits than its factorization.
1990656001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20783.
The product of its (nonzero) digits is 14580, while the sum is 37.
The square root of 1990656001 is about 44616.7681595160. The cubic root of 1990656001 is about 1257.9558694309.
The spelling of 1990656001 in words is "one billion, nine hundred ninety million, six hundred fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •