Base | Representation |
---|---|
bin | 11110001010010111001101… |
… | …100001110010110101010001 |
3 | 122101200112220102002121122011 |
4 | 132022113031201302311101 |
5 | 114341343343330001301 |
6 | 1150044103241142521 |
7 | 36640620501134035 |
oct | 3612271541626521 |
9 | 571615812077564 |
10 | 132653513125201 |
11 | 392a4047986612 |
12 | 12a6518118aa41 |
13 | 59032322ca283 |
14 | 24a867003a1c5 |
15 | 10509503d9a51 |
hex | 78a5cd872d51 |
132653513125201 has 2 divisors, whose sum is σ = 132653513125202. Its totient is φ = 132653513125200.
The previous prime is 132653513125163. The next prime is 132653513125241. The reversal of 132653513125201 is 102521315356231.
It is an a-pointer prime, because the next prime (132653513125241) can be obtained adding 132653513125201 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115090498944576 + 17563014180625 = 10728024^2 + 4190825^2 .
It is a cyclic number.
It is not a de Polignac number, because 132653513125201 - 27 = 132653513125073 is a prime.
It is not a weakly prime, because it can be changed into another prime (132653513125241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66326756562600 + 66326756562601.
It is an arithmetic number, because the mean of its divisors is an integer number (66326756562601).
Almost surely, 2132653513125201 is an apocalyptic number.
It is an amenable number.
132653513125201 is a deficient number, since it is larger than the sum of its proper divisors (1).
132653513125201 is an equidigital number, since it uses as much as digits as its factorization.
132653513125201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162000, while the sum is 40.
The spelling of 132653513125201 in words is "one hundred thirty-two trillion, six hundred fifty-three billion, five hundred thirteen million, one hundred twenty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •