Base | Representation |
---|---|
bin | 10100101101001010111010… |
… | …01101110101110010111001 |
3 | 12222012212101001201110100201 |
4 | 22112211131031311302321 |
5 | 21432001041111323301 |
6 | 240501203005402201 |
7 | 12406421045663665 |
oct | 1226453515656271 |
9 | 188185331643321 |
10 | 45532512214201 |
11 | 13565259129841 |
12 | 513460a269361 |
13 | 1c5390b48965c |
14 | b35adcddd8a5 |
15 | 53e6124da201 |
hex | 29695d375cb9 |
45532512214201 has 2 divisors, whose sum is σ = 45532512214202. Its totient is φ = 45532512214200.
The previous prime is 45532512214183. The next prime is 45532512214213. The reversal of 45532512214201 is 10241221523554.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24364599474601 + 21167912739600 = 4936051^2 + 4600860^2 .
It is a cyclic number.
It is not a de Polignac number, because 45532512214201 - 25 = 45532512214169 is a prime.
It is a super-3 number, since 3×455325122142013 (a number of 42 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (45532512214901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22766256107100 + 22766256107101.
It is an arithmetic number, because the mean of its divisors is an integer number (22766256107101).
Almost surely, 245532512214201 is an apocalyptic number.
It is an amenable number.
45532512214201 is a deficient number, since it is larger than the sum of its proper divisors (1).
45532512214201 is an equidigital number, since it uses as much as digits as its factorization.
45532512214201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96000, while the sum is 37.
Adding to 45532512214201 its reverse (10241221523554), we get a palindrome (55773733737755).
The spelling of 45532512214201 in words is "forty-five trillion, five hundred thirty-two billion, five hundred twelve million, two hundred fourteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •