Base | Representation |
---|---|
bin | 10110101110100000… |
… | …10001000000110100 |
3 | 1011111022220021001202 |
4 | 23113100101000310 |
5 | 144442013100040 |
6 | 5334420112032 |
7 | 611234224160 |
oct | 132720210064 |
9 | 34438807052 |
10 | 12201300020 |
11 | 51a1352328 |
12 | 2446235618 |
13 | 11c5a85770 |
14 | 83a65bca0 |
15 | 4b6285015 |
hex | 2d7411034 |
12201300020 has 48 divisors (see below), whose sum is σ = 31535672448. Its totient is φ = 3861509760.
The previous prime is 12201299927. The next prime is 12201300029. The reversal of 12201300020 is 2000310221.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 12201299974 and 12201300010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201300029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3350186 + ... + 3353825.
It is an arithmetic number, because the mean of its divisors is an integer number (656993176).
Almost surely, 212201300020 is an apocalyptic number.
12201300020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12201300020 is an abundant number, since it is smaller than the sum of its proper divisors (19334372428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12201300020 is a wasteful number, since it uses less digits than its factorization.
12201300020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6704040 (or 6704038 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 12201300020 its reverse (2000310221), we get a palindrome (14201610241).
The spelling of 12201300020 in words is "twelve billion, two hundred one million, three hundred thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •