Base | Representation |
---|---|
bin | 1011100101001000000001… |
… | …1100010111001000111001 |
3 | 1200002012122111100210221211 |
4 | 2321102000130113020321 |
5 | 3132102013110440201 |
6 | 43025111250003121 |
7 | 2452613453111254 |
oct | 271220034271071 |
9 | 50065574323854 |
10 | 12732437983801 |
11 | 4069884342878 |
12 | 151776b8764a1 |
13 | 714882349483 |
14 | 32037903809b |
15 | 1712eeb7c651 |
hex | b9480717239 |
12732437983801 has 2 divisors, whose sum is σ = 12732437983802. Its totient is φ = 12732437983800.
The previous prime is 12732437983789. The next prime is 12732437983823. The reversal of 12732437983801 is 10838973423721.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6936502108176 + 5795935875625 = 2633724^2 + 2407475^2 .
It is a cyclic number.
It is not a de Polignac number, because 12732437983801 - 27 = 12732437983673 is a prime.
It is a super-2 number, since 2×127324379838012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12732437983871) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6366218991900 + 6366218991901.
It is an arithmetic number, because the mean of its divisors is an integer number (6366218991901).
Almost surely, 212732437983801 is an apocalyptic number.
It is an amenable number.
12732437983801 is a deficient number, since it is larger than the sum of its proper divisors (1).
12732437983801 is an equidigital number, since it uses as much as digits as its factorization.
12732437983801 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12192768, while the sum is 58.
The spelling of 12732437983801 in words is "twelve trillion, seven hundred thirty-two billion, four hundred thirty-seven million, nine hundred eighty-three thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.263 sec. • engine limits •