Base | Representation |
---|---|
bin | 1001001100100010011011… |
… | …1001000010001010011101 |
3 | 1022210121021100122220222110 |
4 | 2103020212321002022131 |
5 | 2311124314402000221 |
6 | 33300533134104233 |
7 | 2062332066463644 |
oct | 223104671021235 |
9 | 38717240586873 |
10 | 10111005500061 |
11 | 3249065014214 |
12 | 11736b734b079 |
13 | 584604a69b7b |
14 | 26d537a9235b |
15 | 128025456776 |
hex | 93226e4229d |
10111005500061 has 8 divisors (see below), whose sum is σ = 13551923602944. Its totient is φ = 6705378865280.
The previous prime is 10111005500039. The next prime is 10111005500087. The reversal of 10111005500061 is 16000550011101.
It is a happy number.
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 10111005500061 - 213 = 10111005491869 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111005508061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8822866356 + ... + 8822867501.
It is an arithmetic number, because the mean of its divisors is an integer number (1693990450368).
Almost surely, 210111005500061 is an apocalyptic number.
It is an amenable number.
10111005500061 is a deficient number, since it is larger than the sum of its proper divisors (3440918102883).
10111005500061 is a wasteful number, since it uses less digits than its factorization.
10111005500061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17645734051.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 10111005500061 its reverse (16000550011101), we get a palindrome (26111555511162).
The spelling of 10111005500061 in words is "ten trillion, one hundred eleven billion, five million, five hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •