Base | Representation |
---|---|
bin | 111011000001100… |
… | …011100101100011 |
3 | 2120000100121100112 |
4 | 323001203211203 |
5 | 4012001414101 |
6 | 242132441535 |
7 | 33353050016 |
oct | 7301434543 |
9 | 2500317315 |
10 | 990263651 |
11 | 468a83813 |
12 | 2377792ab |
13 | 12a20b630 |
14 | 9573537d |
15 | 5be0b6bb |
hex | 3b063963 |
990263651 has 8 divisors (see below), whose sum is σ = 1129169664. Its totient is φ = 860319360.
The previous prime is 990263647. The next prime is 990263711. The reversal of 990263651 is 156362099.
990263651 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 990263651 - 22 = 990263647 is a prime.
It is a super-3 number, since 3×9902636513 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 990263599 and 990263608.
It is not an unprimeable number, because it can be changed into a prime (990263051) 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, 2240195 + ... + 2240636.
It is an arithmetic number, because the mean of its divisors is an integer number (141146208).
Almost surely, 2990263651 is an apocalyptic number.
990263651 is a deficient number, since it is larger than the sum of its proper divisors (138906013).
990263651 is a wasteful number, since it uses less digits than its factorization.
990263651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4480861.
The product of its (nonzero) digits is 87480, while the sum is 41.
The square root of 990263651 is about 31468.4548556169. The cubic root of 990263651 is about 996.7439600438.
The spelling of 990263651 in words is "nine hundred ninety million, two hundred sixty-three thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •