Base | Representation |
---|---|
bin | 10100001011000010… |
… | …11101101011011001 |
3 | 1000221202200220012101 |
4 | 22011201131223121 |
5 | 134134444423013 |
6 | 4550354043401 |
7 | 532244063305 |
oct | 120541355331 |
9 | 30852626171 |
10 | 10830076633 |
11 | 4658328962 |
12 | 2122b79561 |
13 | 103797118c |
14 | 74a4bad05 |
15 | 435bc68dd |
hex | 28585dad9 |
10830076633 has 8 divisors (see below), whose sum is σ = 10965419136. Its totient is φ = 10694850000.
The previous prime is 10830076597. The next prime is 10830076687. The reversal of 10830076633 is 33667003801.
10830076633 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 a cyclic number.
It is not a de Polignac number, because 10830076633 - 213 = 10830068441 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10830076592 and 10830076601.
It is not an unprimeable number, because it can be changed into a prime (10830070633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167383 + ... + 222883.
It is an arithmetic number, because the mean of its divisors is an integer number (1370677392).
Almost surely, 210830076633 is an apocalyptic number.
It is an amenable number.
10830076633 is a deficient number, since it is larger than the sum of its proper divisors (135342503).
10830076633 is an equidigital number, since it uses as much as digits as its factorization.
10830076633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57935.
The product of its (nonzero) digits is 54432, while the sum is 37.
The spelling of 10830076633 in words is "ten billion, eight hundred thirty million, seventy-six thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •