Base | Representation |
---|---|
bin | 1011000010010111100100… |
… | …1011010000011101101001 |
3 | 1120222010101000021002010121 |
4 | 2300211321023100131221 |
5 | 3042311111243332403 |
6 | 41450515333043241 |
7 | 2361514301460403 |
oct | 260457113203551 |
9 | 46863330232117 |
10 | 12135315605353 |
11 | 3959616323a06 |
12 | 143baa4786521 |
13 | 6a0480925b15 |
14 | 2dd4d1021b73 |
15 | 160a0277d3bd |
hex | b09792d0769 |
12135315605353 has 4 divisors (see below), whose sum is σ = 12181457490048. Its totient is φ = 12089173720660.
The previous prime is 12135315605291. The next prime is 12135315605381. The reversal of 12135315605353 is 35350651353121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12135315605353 - 217 = 12135315474281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12135315605383) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23070941953 + ... + 23070942478.
It is an arithmetic number, because the mean of its divisors is an integer number (3045364372512).
Almost surely, 212135315605353 is an apocalyptic number.
It is an amenable number.
12135315605353 is a deficient number, since it is larger than the sum of its proper divisors (46141884695).
12135315605353 is an equidigital number, since it uses as much as digits as its factorization.
12135315605353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46141884694.
The product of its (nonzero) digits is 607500, while the sum is 43.
Adding to 12135315605353 its reverse (35350651353121), we get a palindrome (47485966958474).
The spelling of 12135315605353 in words is "twelve trillion, one hundred thirty-five billion, three hundred fifteen million, six hundred five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •