Base | Representation |
---|---|
bin | 10100011110101010111… |
… | …000011100101110001101 |
3 | 11222112112122011211021201 |
4 | 110132222320130232031 |
5 | 141024143213331341 |
6 | 2554303042025501 |
7 | 203450506040404 |
oct | 24365270345615 |
9 | 4875478154251 |
10 | 1407321230221 |
11 | 4a2929166985 |
12 | 1a88b9048291 |
13 | a292c631c6a |
14 | 4c186aa463b |
15 | 2691ac7d331 |
hex | 147aae1cb8d |
1407321230221 has 2 divisors, whose sum is σ = 1407321230222. Its totient is φ = 1407321230220.
The previous prime is 1407321230177. The next prime is 1407321230239. The reversal of 1407321230221 is 1220321237041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1268970708196 + 138350522025 = 1126486^2 + 371955^2 .
It is a cyclic number.
It is not a de Polignac number, because 1407321230221 - 227 = 1407187012493 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1407321230221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1407321230261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 703660615110 + 703660615111.
It is an arithmetic number, because the mean of its divisors is an integer number (703660615111).
Almost surely, 21407321230221 is an apocalyptic number.
It is an amenable number.
1407321230221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1407321230221 is an equidigital number, since it uses as much as digits as its factorization.
1407321230221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4032, while the sum is 28.
Adding to 1407321230221 its reverse (1220321237041), we get a palindrome (2627642467262).
The spelling of 1407321230221 in words is "one trillion, four hundred seven billion, three hundred twenty-one million, two hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •