Base | Representation |
---|---|
bin | 11100110100011001100… |
… | …11100011001001001101 |
3 | 10111122220002000210100121 |
4 | 32122030303203021031 |
5 | 112210414412122423 |
6 | 2034521021224541 |
7 | 131353124640226 |
oct | 16321463431115 |
9 | 3448802023317 |
10 | 990204801613 |
11 | 351a41883415 |
12 | 13baa9702151 |
13 | 724b6b57071 |
14 | 35cd759624d |
15 | 1ab5686045d |
hex | e68cce324d |
990204801613 has 2 divisors, whose sum is σ = 990204801614. Its totient is φ = 990204801612.
The previous prime is 990204801559. The next prime is 990204801623. The reversal of 990204801613 is 316108402099.
It is a happy number.
990204801613 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 708160959529 + 282043842084 = 841523^2 + 531078^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-990204801613 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 990204801613.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (990204801623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 495102400806 + 495102400807.
It is an arithmetic number, because the mean of its divisors is an integer number (495102400807).
Almost surely, 2990204801613 is an apocalyptic number.
It is an amenable number.
990204801613 is a deficient number, since it is larger than the sum of its proper divisors (1).
990204801613 is an equidigital number, since it uses as much as digits as its factorization.
990204801613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 93312, while the sum is 43.
The spelling of 990204801613 in words is "nine hundred ninety billion, two hundred four million, eight hundred one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •