Base | Representation |
---|---|
bin | 101001001100000000010… |
… | …011101101101101111101 |
3 | 101000120201122112020100021 |
4 | 221030000103231231331 |
5 | 332333113441203221 |
6 | 10004132414532141 |
7 | 411326445165256 |
oct | 51140023555575 |
9 | 11016648466307 |
10 | 2830388616061 |
11 | 9a13a7649606 |
12 | 39866b507051 |
13 | 176b9b25c966 |
14 | 9adc4addb2d |
15 | 4d9590ae041 |
hex | 293004edb7d |
2830388616061 has 2 divisors, whose sum is σ = 2830388616062. Its totient is φ = 2830388616060.
The previous prime is 2830388615987. The next prime is 2830388616071. The reversal of 2830388616061 is 1606168830382.
2830388616061 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., 2769178887225 + 61209728836 = 1664085^2 + 247406^2 .
It is a cyclic number.
It is not a de Polignac number, because 2830388616061 - 233 = 2821798681469 is a prime.
It is a super-2 number, since 2×28303886160612 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2830388616071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1415194308030 + 1415194308031.
It is an arithmetic number, because the mean of its divisors is an integer number (1415194308031).
Almost surely, 22830388616061 is an apocalyptic number.
It is an amenable number.
2830388616061 is a deficient number, since it is larger than the sum of its proper divisors (1).
2830388616061 is an equidigital number, since it uses as much as digits as its factorization.
2830388616061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1990656, while the sum is 52.
The spelling of 2830388616061 in words is "two trillion, eight hundred thirty billion, three hundred eighty-eight million, six hundred sixteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •