Base | Representation |
---|---|
bin | 110000001101011111011… |
… | …000011000101001000011 |
3 | 102201201111001122111111111 |
4 | 300031133120120221003 |
5 | 413240031110404443 |
6 | 11013551432424151 |
7 | 461233503316402 |
oct | 60153730305103 |
9 | 12651431574444 |
10 | 3313020013123 |
11 | 10680534775a7 |
12 | 456103848057 |
13 | 1b0554c19892 |
14 | b64cb2d3639 |
15 | 5b2a4ea969d |
hex | 3035f618a43 |
3313020013123 has 2 divisors, whose sum is σ = 3313020013124. Its totient is φ = 3313020013122.
The previous prime is 3313020013091. The next prime is 3313020013153. The reversal of 3313020013123 is 3213100203133.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3313020013123 - 25 = 3313020013091 is a prime.
It is a super-2 number, since 2×33130200131232 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3313020013094 and 3313020013103.
It is not a weakly prime, because it can be changed into another prime (3313020013153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1656510006561 + 1656510006562.
It is an arithmetic number, because the mean of its divisors is an integer number (1656510006562).
Almost surely, 23313020013123 is an apocalyptic number.
3313020013123 is a deficient number, since it is larger than the sum of its proper divisors (1).
3313020013123 is an equidigital number, since it uses as much as digits as its factorization.
3313020013123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 3313020013123 its reverse (3213100203133), we get a palindrome (6526120216256).
The spelling of 3313020013123 in words is "three trillion, three hundred thirteen billion, twenty million, thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •