Base | Representation |
---|---|
bin | 10100011000111010100… |
… | …001101000001001100101 |
3 | 11221221120221102101210012 |
4 | 110120322201220021211 |
5 | 140424014123412404 |
6 | 2551401515140005 |
7 | 203141404652504 |
oct | 24307241501145 |
9 | 4857527371705 |
10 | 1401141232229 |
11 | 4a0247774a22 |
12 | 1a7673444605 |
13 | a218619320b |
14 | 4bb5bddc83b |
15 | 266a843ca6e |
hex | 1463a868265 |
1401141232229 has 2 divisors, whose sum is σ = 1401141232230. Its totient is φ = 1401141232228.
The previous prime is 1401141232193. The next prime is 1401141232243. The reversal of 1401141232229 is 9222321411041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1387688712004 + 13452520225 = 1178002^2 + 115985^2 .
It is a cyclic number.
It is not a de Polignac number, because 1401141232229 - 212 = 1401141228133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1401141232195 and 1401141232204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1401141252229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 700570616114 + 700570616115.
It is an arithmetic number, because the mean of its divisors is an integer number (700570616115).
Almost surely, 21401141232229 is an apocalyptic number.
It is an amenable number.
1401141232229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1401141232229 is an equidigital number, since it uses as much as digits as its factorization.
1401141232229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 32.
The spelling of 1401141232229 in words is "one trillion, four hundred one billion, one hundred forty-one million, two hundred thirty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •