Base | Representation |
---|---|
bin | 10110101110011111… |
… | …01101010001111100 |
3 | 1011111022121211022000 |
4 | 23113033231101330 |
5 | 144441443404120 |
6 | 5334413022300 |
7 | 611233044363 |
oct | 132717552174 |
9 | 34438554260 |
10 | 12201153660 |
11 | 51a1262373 |
12 | 2446184990 |
13 | 11c5a33c67 |
14 | 83a6207da |
15 | 4b6256990 |
hex | 2d73ed47c |
12201153660 has 48 divisors (see below), whose sum is σ = 37959146400. Its totient is φ = 3253640832.
The previous prime is 12201153649. The next prime is 12201153661. The reversal of 12201153660 is 6635110221.
12201153660 is a `hidden beast` number, since 122 + 0 + 1 + 1 + 536 + 6 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201153661) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11296825 + ... + 11297904.
It is an arithmetic number, because the mean of its divisors is an integer number (790815550).
Almost surely, 212201153660 is an apocalyptic number.
12201153660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12201153660 is an abundant number, since it is smaller than the sum of its proper divisors (25757992740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12201153660 is a wasteful number, since it uses less digits than its factorization.
12201153660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22594747 (or 22594739 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 12201153660 its reverse (6635110221), we get a palindrome (18836263881).
The spelling of 12201153660 in words is "twelve billion, two hundred one million, one hundred fifty-three thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.887 sec. • engine limits •