Base | Representation |
---|---|
bin | 1011000010010111010101… |
… | …1100110111101001110001 |
3 | 1120222010012122200011100221 |
4 | 2300211311130313221301 |
5 | 3042310444244112312 |
6 | 41450505221413041 |
7 | 2361512612344315 |
oct | 260456534675161 |
9 | 46863178604327 |
10 | 12135253113457 |
11 | 3959594020911 |
12 | 143ba8786a181 |
13 | 6a04709b5876 |
14 | 2dd4c69d5b45 |
15 | 1609ec037207 |
hex | b0975737a71 |
12135253113457 has 2 divisors, whose sum is σ = 12135253113458. Its totient is φ = 12135253113456.
The previous prime is 12135253113437. The next prime is 12135253113517. The reversal of 12135253113457 is 75431135253121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11922214556736 + 213038556721 = 3452856^2 + 461561^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12135253113457 is a prime.
It is a super-2 number, since 2×121352531134572 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12135253113437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6067626556728 + 6067626556729.
It is an arithmetic number, because the mean of its divisors is an integer number (6067626556729).
Almost surely, 212135253113457 is an apocalyptic number.
It is an amenable number.
12135253113457 is a deficient number, since it is larger than the sum of its proper divisors (1).
12135253113457 is an equidigital number, since it uses as much as digits as its factorization.
12135253113457 is an evil number, because the sum of its binary digits is even.
The product of its digits is 378000, while the sum is 43.
Adding to 12135253113457 its reverse (75431135253121), we get a palindrome (87566388366578).
The spelling of 12135253113457 in words is "twelve trillion, one hundred thirty-five billion, two hundred fifty-three million, one hundred thirteen thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •