Base | Representation |
---|---|
bin | 10110000010000101… |
… | …10100011110000001 |
3 | 1010112100202000122221 |
4 | 23001002310132001 |
5 | 143211120121411 |
6 | 5233425331041 |
7 | 566061043156 |
oct | 130102643601 |
9 | 33470660587 |
10 | 11828676481 |
11 | 501aa85796 |
12 | 2361496a81 |
13 | 116680ac6b |
14 | 802d8222d |
15 | 4936cd071 |
hex | 2c10b4781 |
11828676481 has 4 divisors (see below), whose sum is σ = 11828956932. Its totient is φ = 11828396032.
The previous prime is 11828676437. The next prime is 11828676491. The reversal of 11828676481 is 18467682811.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3182652225 + 8646024256 = 56415^2 + 92984^2 .
It is a cyclic number.
It is not a de Polignac number, because 11828676481 - 215 = 11828643713 is a prime.
It is a super-2 number, since 2×118286764812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11828676491) 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 3 ways as a sum of consecutive naturals, for example, 62656 + ... + 166081.
It is an arithmetic number, because the mean of its divisors is an integer number (2957239233).
Almost surely, 211828676481 is an apocalyptic number.
It is an amenable number.
11828676481 is a deficient number, since it is larger than the sum of its proper divisors (280451).
11828676481 is an equidigital number, since it uses as much as digits as its factorization.
11828676481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280450.
The product of its digits is 1032192, while the sum is 52.
The spelling of 11828676481 in words is "eleven billion, eight hundred twenty-eight million, six hundred seventy-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •