Base | Representation |
---|---|
bin | 1011001111000010100001… |
… | …0110011111110011000101 |
3 | 1121201221021000100220210221 |
4 | 2303300220112133303011 |
5 | 3104342422222214344 |
6 | 42134520255544341 |
7 | 2413321633263565 |
oct | 263605026376305 |
9 | 47657230326727 |
10 | 12353002929349 |
11 | 3a32974125445 |
12 | 147611782b0b1 |
13 | 6b7b63459b84 |
14 | 309c621bada5 |
15 | 1664e38e6184 |
hex | b3c2859fcc5 |
12353002929349 has 2 divisors, whose sum is σ = 12353002929350. Its totient is φ = 12353002929348.
The previous prime is 12353002929301. The next prime is 12353002929359. The reversal of 12353002929349 is 94392920035321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10472621516449 + 1880381412900 = 3236143^2 + 1371270^2 .
It is a cyclic number.
It is not a de Polignac number, because 12353002929349 - 221 = 12353000832197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12353002929296 and 12353002929305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12353002929359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6176501464674 + 6176501464675.
It is an arithmetic number, because the mean of its divisors is an integer number (6176501464675).
Almost surely, 212353002929349 is an apocalyptic number.
It is an amenable number.
12353002929349 is a deficient number, since it is larger than the sum of its proper divisors (1).
12353002929349 is an equidigital number, since it uses as much as digits as its factorization.
12353002929349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3149280, while the sum is 52.
The spelling of 12353002929349 in words is "twelve trillion, three hundred fifty-three billion, two million, nine hundred twenty-nine thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •