Base | Representation |
---|---|
bin | 1101000010101101… |
… | …01000100001001001 |
3 | 200001222120002102222 |
4 | 12201112220201021 |
5 | 103320010012301 |
6 | 3114445503425 |
7 | 335342202023 |
oct | 64126504111 |
9 | 20058502388 |
10 | 7002032201 |
11 | 2a7351247a |
12 | 1434b71b75 |
13 | 877867c28 |
14 | 4a5d29013 |
15 | 2aeabb31b |
hex | 1a15a8849 |
7002032201 has 8 divisors (see below), whose sum is σ = 7109404800. Its totient is φ = 6895128240.
The previous prime is 7002032197. The next prime is 7002032207. The reversal of 7002032201 is 1022302007.
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 7002032201 - 22 = 7002032197 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 7002032201.
It is not an unprimeable number, because it can be changed into a prime (7002032207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86990 + ... + 146871.
It is an arithmetic number, because the mean of its divisors is an integer number (888675600).
Almost surely, 27002032201 is an apocalyptic number.
It is an amenable number.
7002032201 is a deficient number, since it is larger than the sum of its proper divisors (107372599).
7002032201 is a wasteful number, since it uses less digits than its factorization.
7002032201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234319.
The product of its (nonzero) digits is 168, while the sum is 17.
The square root of 7002032201 is about 83678.1464959639. The cubic root of 7002032201 is about 1913.1162820356.
Adding to 7002032201 its reverse (1022302007), we get a palindrome (8024334208).
The spelling of 7002032201 in words is "seven billion, two million, thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •