Base | Representation |
---|---|
bin | 11110001010010111001101… |
… | …100010100011001111101101 |
3 | 122101200112220102110200122121 |
4 | 132022113031202203033231 |
5 | 114341343343402323001 |
6 | 1150044103245312541 |
7 | 36640620502621132 |
oct | 3612271542431755 |
9 | 571615812420577 |
10 | 132653513323501 |
11 | 392a40480015a5 |
12 | 12a65181265751 |
13 | 5903232369601 |
14 | 24a867008c589 |
15 | 10509504286a1 |
hex | 78a5cd8a33ed |
132653513323501 has 2 divisors, whose sum is σ = 132653513323502. Its totient is φ = 132653513323500.
The previous prime is 132653513323477. The next prime is 132653513323517. The reversal of 132653513323501 is 105323315356231.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119228360842276 + 13425152481225 = 10919174^2 + 3664035^2 .
It is a cyclic number.
It is not a de Polignac number, because 132653513323501 - 241 = 130454490067949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132653513323531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66326756661750 + 66326756661751.
It is an arithmetic number, because the mean of its divisors is an integer number (66326756661751).
Almost surely, 2132653513323501 is an apocalyptic number.
It is an amenable number.
132653513323501 is a deficient number, since it is larger than the sum of its proper divisors (1).
132653513323501 is an equidigital number, since it uses as much as digits as its factorization.
132653513323501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 729000, while the sum is 43.
Adding to 132653513323501 its reverse (105323315356231), we get a palindrome (237976828679732).
The spelling of 132653513323501 in words is "one hundred thirty-two trillion, six hundred fifty-three billion, five hundred thirteen million, three hundred twenty-three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •