Base | Representation |
---|---|
bin | 101001001111101111001001… |
… | …101011001110001110110101 |
3 | 212210021210112101201001012202 |
4 | 221033233021223032032311 |
5 | 142234034404242004321 |
6 | 1441450341434354245 |
7 | 53131545665624555 |
oct | 5117571153161665 |
9 | 783253471631182 |
10 | 181401327297461 |
11 | 52888964155857 |
12 | 1841896158b985 |
13 | 7a2b0c1886b2b |
14 | 32b1c2a39b165 |
15 | 15e89e8b4b70b |
hex | a4fbc9ace3b5 |
181401327297461 has 2 divisors, whose sum is σ = 181401327297462. Its totient is φ = 181401327297460.
The previous prime is 181401327297403. The next prime is 181401327297467. The reversal of 181401327297461 is 164792723104181.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 137817973368100 + 43583353929361 = 11739590^2 + 6601769^2 .
It is a cyclic number.
It is not a de Polignac number, because 181401327297461 - 210 = 181401327296437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 181401327297397 and 181401327297406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (181401327297467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 90700663648730 + 90700663648731.
It is an arithmetic number, because the mean of its divisors is an integer number (90700663648731).
Almost surely, 2181401327297461 is an apocalyptic number.
It is an amenable number.
181401327297461 is a deficient number, since it is larger than the sum of its proper divisors (1).
181401327297461 is an equidigital number, since it uses as much as digits as its factorization.
181401327297461 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4064256, while the sum is 56.
The spelling of 181401327297461 in words is "one hundred eighty-one trillion, four hundred one billion, three hundred twenty-seven million, two hundred ninety-seven thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •