Base | Representation |
---|---|
bin | 10111111001011011010… |
… | …00101101101011101000 |
3 | 2220111102011210101202212 |
4 | 23330231220231223220 |
5 | 101423110211314003 |
6 | 1425113220544252 |
7 | 113215506152204 |
oct | 13745550555350 |
9 | 2814364711685 |
10 | 821104401128 |
11 | 297257034720 |
12 | 113176252088 |
13 | 5c5783b62ab |
14 | 2ba551b3b04 |
15 | 1655aeb2dd8 |
hex | bf2da2dae8 |
821104401128 has 32 divisors (see below), whose sum is σ = 1767928140000. Its totient is φ = 353585626560.
The previous prime is 821104401121. The next prime is 821104401149.
821104401128 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 821104401094 and 821104401103.
It is not an unprimeable number, because it can be changed into a prime (821104401121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 245543903 + ... + 245547246.
It is an arithmetic number, because the mean of its divisors is an integer number (55247754375).
Almost surely, 2821104401128 is an apocalyptic number.
821104401128 is a gapful number since it is divisible by the number (88) formed by its first and last digit.
It is an amenable number.
821104401128 is an abundant number, since it is smaller than the sum of its proper divisors (946823738872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
821104401128 is a wasteful number, since it uses less digits than its factorization.
821104401128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 491091185 (or 491091181 counting only the distinct ones).
The product of its (nonzero) digits is 4096, while the sum is 32.
The spelling of 821104401128 in words is "eight hundred twenty-one billion, one hundred four million, four hundred one thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •