Base | Representation |
---|---|
bin | 110000010100010001111… |
… | …010101000000110100101 |
3 | 102202102022010121111112001 |
4 | 300110101322220012211 |
5 | 413344443414113333 |
6 | 11021155100525301 |
7 | 461612245615312 |
oct | 60242172500645 |
9 | 12672263544461 |
10 | 3320310301093 |
11 | 1070154671885 |
12 | 4575b9250831 |
13 | 1b11473ccb46 |
14 | b69bd615d09 |
15 | 5b580014b7d |
hex | 30511ea81a5 |
3320310301093 has 2 divisors, whose sum is σ = 3320310301094. Its totient is φ = 3320310301092.
The previous prime is 3320310300973. The next prime is 3320310301127. The reversal of 3320310301093 is 3901030130233.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3274771594689 + 45538706404 = 1809633^2 + 213398^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3320310301093 is a prime.
It is a super-2 number, since 2×33203103010932 (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 (3320310302093) 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 as a sum of consecutive naturals, namely, 1660155150546 + 1660155150547.
It is an arithmetic number, because the mean of its divisors is an integer number (1660155150547).
Almost surely, 23320310301093 is an apocalyptic number.
It is an amenable number.
3320310301093 is a deficient number, since it is larger than the sum of its proper divisors (1).
3320310301093 is an equidigital number, since it uses as much as digits as its factorization.
3320310301093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4374, while the sum is 28.
The spelling of 3320310301093 in words is "three trillion, three hundred twenty billion, three hundred ten million, three hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •