Base | Representation |
---|---|
bin | 110000001101101010111… |
… | …001000111010110001101 |
3 | 102201201222112001111002011 |
4 | 300031222321013112031 |
5 | 413240430031024123 |
6 | 11014022532101221 |
7 | 461241340016506 |
oct | 60155271072615 |
9 | 12651875044064 |
10 | 3313213142413 |
11 | 1068142497489 |
12 | 456158464811 |
13 | 1b0585c39775 |
14 | b6508c07bad |
15 | 5b2b6e07e0d |
hex | 3036ae4758d |
3313213142413 has 2 divisors, whose sum is σ = 3313213142414. Its totient is φ = 3313213142412.
The previous prime is 3313213142399. The next prime is 3313213142441. The reversal of 3313213142413 is 3142413123133.
3313213142413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2129255884809 + 1183957257604 = 1459197^2 + 1088098^2 .
It is a cyclic number.
It is not a de Polignac number, because 3313213142413 - 213 = 3313213134221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3313213142713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1656606571206 + 1656606571207.
It is an arithmetic number, because the mean of its divisors is an integer number (1656606571207).
Almost surely, 23313213142413 is an apocalyptic number.
It is an amenable number.
3313213142413 is a deficient number, since it is larger than the sum of its proper divisors (1).
3313213142413 is an equidigital number, since it uses as much as digits as its factorization.
3313213142413 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15552, while the sum is 31.
Adding to 3313213142413 its reverse (3142413123133), we get a palindrome (6455626265546).
The spelling of 3313213142413 in words is "three trillion, three hundred thirteen billion, two hundred thirteen million, one hundred forty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •