Base | Representation |
---|---|
bin | 1011000010001000011011… |
… | …0111001110000001101100 |
3 | 1120221201212200121110020120 |
4 | 2300202012313032001230 |
5 | 3042224300032004340 |
6 | 41445004110444540 |
7 | 2361311455611621 |
oct | 260420667160154 |
9 | 46851780543216 |
10 | 12131250266220 |
11 | 395791a5724a8 |
12 | 143b14b203750 |
13 | 69cc836081c7 |
14 | 2dd227140348 |
15 | 1608658ed4d0 |
hex | b0886dce06c |
12131250266220 has 48 divisors (see below), whose sum is σ = 33971018309088. Its totient is φ = 3234665064960.
The previous prime is 12131250266183. The next prime is 12131250266237. The reversal of 12131250266220 is 2266205213121.
It is a happy number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 9884449 + ... + 11043768.
It is an arithmetic number, because the mean of its divisors is an integer number (707729548106).
Almost surely, 212131250266220 is an apocalyptic number.
12131250266220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12131250266220 is an abundant number, since it is smaller than the sum of its proper divisors (21839768042868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12131250266220 is a wasteful number, since it uses less digits than its factorization.
12131250266220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20937890 (or 20937888 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
Adding to 12131250266220 its reverse (2266205213121), we get a palindrome (14397455479341).
The spelling of 12131250266220 in words is "twelve trillion, one hundred thirty-one billion, two hundred fifty million, two hundred sixty-six thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •