Base | Representation |
---|---|
bin | 101111001100100100010… |
… | …110010011000010101111 |
3 | 102111001112212012200212012 |
4 | 233030210112103002233 |
5 | 411114244343232143 |
6 | 10521542304031435 |
7 | 453215151160463 |
oct | 57144426230257 |
9 | 12431485180765 |
10 | 3243310133423 |
11 | 1040531021178 |
12 | 4446aa00257b |
13 | 1a6ac5921159 |
14 | b2d9703c4a3 |
15 | 595750a5418 |
hex | 2f3245930af |
3243310133423 has 2 divisors, whose sum is σ = 3243310133424. Its totient is φ = 3243310133422.
The previous prime is 3243310133417. The next prime is 3243310133491.
3243310133423 is nontrivially palindromic in base 10.
3243310133423 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 is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 3243310133423 - 26 = 3243310133359 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3243310133423.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3243310135423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1621655066711 + 1621655066712.
It is an arithmetic number, because the mean of its divisors is an integer number (1621655066712).
Almost surely, 23243310133423 is an apocalyptic number.
3243310133423 is a deficient number, since it is larger than the sum of its proper divisors (1).
3243310133423 is an equidigital number, since it uses as much as digits as its factorization.
3243310133423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 32.
It can be divided in two parts, 3243310 and 133423, that added together give a palindrome (3376733).
The spelling of 3243310133423 in words is "three trillion, two hundred forty-three billion, three hundred ten million, one hundred thirty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •