Base | Representation |
---|---|
bin | 100000001001110101011001… |
… | …100001101001101000111011 |
3 | 200112200222110000221020011211 |
4 | 200021311121201221220323 |
5 | 122013403414323324311 |
6 | 1220432212343303551 |
7 | 41533526256635155 |
oct | 4011653141515073 |
9 | 615628400836154 |
10 | 141413300214331 |
11 | 41071053374402 |
12 | 13a3aa1814abb7 |
13 | 60ba2a8960782 |
14 | 26cc62408dad5 |
15 | 1153740100821 |
hex | 809d59869a3b |
141413300214331 has 2 divisors, whose sum is σ = 141413300214332. Its totient is φ = 141413300214330.
The previous prime is 141413300214271. The next prime is 141413300214349. The reversal of 141413300214331 is 133412003314141.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 141413300214331 - 217 = 141413300083259 is a prime.
It is a super-2 number, since 2×1414133002143312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 141413300214293 and 141413300214302.
It is not a weakly prime, because it can be changed into another prime (141413300214631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70706650107165 + 70706650107166.
It is an arithmetic number, because the mean of its divisors is an integer number (70706650107166).
Almost surely, 2141413300214331 is an apocalyptic number.
141413300214331 is a deficient number, since it is larger than the sum of its proper divisors (1).
141413300214331 is an equidigital number, since it uses as much as digits as its factorization.
141413300214331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 141413300214331 its reverse (133412003314141), we get a palindrome (274825303528472).
The spelling of 141413300214331 in words is "one hundred forty-one trillion, four hundred thirteen billion, three hundred million, two hundred fourteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •