Base | Representation |
---|---|
bin | 11010010011010100… |
… | …011100000000010001 |
3 | 2200220012012101022102 |
4 | 122103110130000101 |
5 | 430314300141423 |
6 | 20550211250145 |
7 | 2016564020315 |
oct | 322324340021 |
9 | 80805171272 |
10 | 28241412113 |
11 | 10a825a4a12 |
12 | 5581ba9955 |
13 | 2880c44555 |
14 | 151ca71b45 |
15 | b04550c28 |
hex | 69351c011 |
28241412113 has 16 divisors (see below), whose sum is σ = 29525530320. Its totient is φ = 26978832384.
The previous prime is 28241412097. The next prime is 28241412127. The reversal of 28241412113 is 31121414282.
It can be written as a sum of positive squares in 8 ways, for example, as 1334587024 + 26906825089 = 36532^2 + 164033^2 .
It is a cyclic number.
It is not a de Polignac number, because 28241412113 - 24 = 28241412097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (28241412193) 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, 1935995 + ... + 1950527.
It is an arithmetic number, because the mean of its divisors is an integer number (1845345645).
Almost surely, 228241412113 is an apocalyptic number.
It is an amenable number.
28241412113 is a deficient number, since it is larger than the sum of its proper divisors (1284118207).
28241412113 is a wasteful number, since it uses less digits than its factorization.
28241412113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15268.
The product of its digits is 3072, while the sum is 29.
Adding to 28241412113 its reverse (31121414282), we get a palindrome (59362826395).
The spelling of 28241412113 in words is "twenty-eight billion, two hundred forty-one million, four hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •