Base | Representation |
---|---|
bin | 10100100111000011… |
… | …110100111101000101 |
3 | 2010010021210011102000 |
4 | 110213003310331011 |
5 | 330310304314422 |
6 | 14055541535513 |
7 | 1412256116235 |
oct | 244703647505 |
9 | 63107704360 |
10 | 22130151237 |
11 | 9426991197 |
12 | 4357414599 |
13 | 2118ac155c |
14 | 10dd17dcc5 |
15 | 897c8bcac |
hex | 5270f4f45 |
22130151237 has 16 divisors (see below), whose sum is σ = 32986553280. Its totient is φ = 14662919376.
The previous prime is 22130151229. The next prime is 22130151269. The reversal of 22130151237 is 73215103122.
It is not a de Polignac number, because 22130151237 - 23 = 22130151229 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 22130151237.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22130251237) 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, 2509818 + ... + 2518619.
It is an arithmetic number, because the mean of its divisors is an integer number (2061659580).
Almost surely, 222130151237 is an apocalyptic number.
22130151237 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
22130151237 is a deficient number, since it is larger than the sum of its proper divisors (10856402043).
22130151237 is a wasteful number, since it uses less digits than its factorization.
22130151237 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5028609 (or 5028603 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
Adding to 22130151237 its reverse (73215103122), we get a palindrome (95345254359).
The spelling of 22130151237 in words is "twenty-two billion, one hundred thirty million, one hundred fifty-one thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •