Base | Representation |
---|---|
bin | 101011101010011110101… |
… | …1100001001101000111001 |
3 | 210020200212222120112102012 |
4 | 1113110331130021220321 |
5 | 1241310223111232301 |
6 | 20432511202015305 |
7 | 1156364566141211 |
oct | 127247534115071 |
9 | 23220788515365 |
10 | 6001100102201 |
11 | 1a04063617526 |
12 | 80b078347535 |
13 | 346b94248149 |
14 | 16a651d57241 |
15 | a618083debb |
hex | 5753d709a39 |
6001100102201 has 16 divisors (see below), whose sum is σ = 6035695131024. Its totient is φ = 5966622864384.
The previous prime is 6001100102141. The next prime is 6001100102213. The reversal of 6001100102201 is 1022010011006.
It can be written as a sum of positive squares in 8 ways, for example, as 140711263225 + 5860388838976 = 375115^2 + 2420824^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6001100102201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6001100101201) 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 15 ways as a sum of consecutive naturals, for example, 201926795 + ... + 201956511.
It is an arithmetic number, because the mean of its divisors is an integer number (377230945689).
Almost surely, 26001100102201 is an apocalyptic number.
It is an amenable number.
6001100102201 is a deficient number, since it is larger than the sum of its proper divisors (34595028823).
6001100102201 is a wasteful number, since it uses less digits than its factorization.
6001100102201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31660.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 6001100102201 its reverse (1022010011006), we get a palindrome (7023110113207).
The spelling of 6001100102201 in words is "six trillion, one billion, one hundred million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •