Base | Representation |
---|---|
bin | 1010100001010001… |
… | …0000010111011001 |
3 | 21021210122002010200 |
4 | 2220110100113121 |
5 | 21240403212301 |
6 | 1144113332413 |
7 | 126656413500 |
oct | 25024202731 |
9 | 7253562120 |
10 | 2823882201 |
11 | 121a00a548 |
12 | 669867109 |
13 | 36006c71a |
14 | 1cb07d837 |
15 | 117da5c86 |
hex | a85105d9 |
2823882201 has 72 divisors (see below), whose sum is σ = 5212134720. Its totient is φ = 1462152384.
The previous prime is 2823882199. The next prime is 2823882203. The reversal of 2823882201 is 1022883282.
It is an interprime number because it is at equal distance from previous prime (2823882199) and next prime (2823882203).
It is not a de Polignac number, because 2823882201 - 21 = 2823882199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2823882203) 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 71 ways as a sum of consecutive naturals, for example, 185391 + ... + 200043.
It is an arithmetic number, because the mean of its divisors is an integer number (72390760).
Almost surely, 22823882201 is an apocalyptic number.
2823882201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2823882201 is a deficient number, since it is larger than the sum of its proper divisors (2388252519).
2823882201 is a wasteful number, since it uses less digits than its factorization.
2823882201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14715 (or 14705 counting only the distinct ones).
The product of its (nonzero) digits is 24576, while the sum is 36.
The square root of 2823882201 is about 53140.2126548248. The cubic root of 2823882201 is about 1413.4556689908.
The spelling of 2823882201 in words is "two billion, eight hundred twenty-three million, eight hundred eighty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •