Base | Representation |
---|---|
bin | 10110101110110101… |
… | …01001000110111001 |
3 | 1011111112000110101102 |
4 | 23113122221012321 |
5 | 144443212121103 |
6 | 5334554301145 |
7 | 611266313453 |
oct | 132732510671 |
9 | 34445013342 |
10 | 12204020153 |
11 | 51a293aa76 |
12 | 24471277b5 |
13 | 11c64c8900 |
14 | 83ab692d3 |
15 | 4b6620e88 |
hex | 2d76a91b9 |
12204020153 has 12 divisors (see below), whose sum is σ = 13235737788. Its totient is φ = 11247575040.
The previous prime is 12204020123. The next prime is 12204020159. The reversal of 12204020153 is 35102040221.
It can be written as a sum of positive squares in 6 ways, for example, as 1589457424 + 10614562729 = 39868^2 + 103027^2 .
It is not a de Polignac number, because 12204020153 - 28 = 12204019897 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12204020159) 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 11 ways as a sum of consecutive naturals, for example, 52001 + ... + 164657.
It is an arithmetic number, because the mean of its divisors is an integer number (1102978149).
Almost surely, 212204020153 is an apocalyptic number.
12204020153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12204020153 is a deficient number, since it is larger than the sum of its proper divisors (1031717635).
12204020153 is a wasteful number, since it uses less digits than its factorization.
12204020153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113324 (or 113311 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 12204020153 its reverse (35102040221), we get a palindrome (47306060374).
The spelling of 12204020153 in words is "twelve billion, two hundred four million, twenty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •