Base | Representation |
---|---|
bin | 1010100010011010… |
… | …1001100011011011 |
3 | 21022010201001100110 |
4 | 2220212221203123 |
5 | 21243122011323 |
6 | 1144404535403 |
7 | 130045405221 |
oct | 25046514333 |
9 | 7263631313 |
10 | 2828703963 |
11 | 1221803178 |
12 | 66b3b1563 |
13 | 36106a337 |
14 | 1cb976b11 |
15 | 118509793 |
hex | a89a98db |
2828703963 has 8 divisors (see below), whose sum is σ = 3780198400. Its totient is φ = 1881506088.
The previous prime is 2828703953. The next prime is 2828704031. The reversal of 2828703963 is 3693078282.
It is a happy number.
2828703963 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2828703963 - 24 = 2828703947 is a prime.
It is a super-3 number, since 3×28287039633 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2828703953) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1072603 + ... + 1075236.
It is an arithmetic number, because the mean of its divisors is an integer number (472524800).
Almost surely, 22828703963 is an apocalyptic number.
2828703963 is a deficient number, since it is larger than the sum of its proper divisors (951494437).
2828703963 is a wasteful number, since it uses less digits than its factorization.
2828703963 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2148281.
The product of its (nonzero) digits is 870912, while the sum is 48.
The square root of 2828703963 is about 53185.5616027508. The cubic root of 2828703963 is about 1414.2597005768.
The spelling of 2828703963 in words is "two billion, eight hundred twenty-eight million, seven hundred three thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •