Base | Representation |
---|---|
bin | 1100010100101101… |
… | …11010100100111001 |
3 | 122002002121022121000 |
4 | 12022112322210321 |
5 | 102022223331301 |
6 | 3012304435213 |
7 | 322646012610 |
oct | 61226724471 |
9 | 18062538530 |
10 | 6616230201 |
11 | 2895764749 |
12 | 1347918b09 |
13 | 815957c19 |
14 | 46a9bc877 |
15 | 28acae786 |
hex | 18a5ba939 |
6616230201 has 32 divisors (see below), whose sum is σ = 11588371200. Its totient is φ = 3650330880.
The previous prime is 6616230167. The next prime is 6616230253. The reversal of 6616230201 is 1020326166.
6616230201 is a `hidden beast` number, since 6 + 616 + 23 + 0 + 20 + 1 = 666.
It is not a de Polignac number, because 6616230201 - 29 = 6616229689 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (6616230001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 598080 + ... + 609041.
It is an arithmetic number, because the mean of its divisors is an integer number (362136600).
Almost surely, 26616230201 is an apocalyptic number.
It is an amenable number.
6616230201 is a deficient number, since it is larger than the sum of its proper divisors (4972140999).
6616230201 is a wasteful number, since it uses less digits than its factorization.
6616230201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1207166 (or 1207160 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 6616230201 is about 81340.2126933536. The cubic root of 6616230201 is about 1877.3137848520.
Adding to 6616230201 its reverse (1020326166), we get a palindrome (7636556367).
The spelling of 6616230201 in words is "six billion, six hundred sixteen million, two hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •