Base | Representation |
---|---|
bin | 10110110000111010… |
… | …10101011010100001 |
3 | 1011112201220200112100 |
4 | 23120131111122201 |
5 | 200012201100022 |
6 | 5340421121013 |
7 | 611601030324 |
oct | 133035253241 |
9 | 34481820470 |
10 | 12221503137 |
11 | 52017a1218 |
12 | 2450b59169 |
13 | 11ca00a47c |
14 | 83d1da7bb |
15 | 4b7e261ac |
hex | 2d87556a1 |
12221503137 has 24 divisors (see below), whose sum is σ = 18030841920. Its totient is φ = 7975064160.
The previous prime is 12221503121. The next prime is 12221503183. The reversal of 12221503137 is 73130512221.
12221503137 is a `hidden beast` number, since 1 + 2 + 2 + 21 + 503 + 137 = 666.
12221503137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12221503137 - 24 = 12221503121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12221503137.
It is not an unprimeable number, because it can be changed into a prime (12221503187) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20023 + ... + 157619.
It is an arithmetic number, because the mean of its divisors is an integer number (751285080).
Almost surely, 212221503137 is an apocalyptic number.
It is an amenable number.
12221503137 is a deficient number, since it is larger than the sum of its proper divisors (5809338783).
12221503137 is a wasteful number, since it uses less digits than its factorization.
12221503137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137813 (or 137810 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The spelling of 12221503137 in words is "twelve billion, two hundred twenty-one million, five hundred three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •