Base | Representation |
---|---|
bin | 11111111011010010111010… |
… | …100000111010010001111011 |
3 | 200102011110121000200012012022 |
4 | 133323102322200322101323 |
5 | 121401021240201432311 |
6 | 1214345220515105055 |
7 | 41401406526330323 |
oct | 3773227240722173 |
9 | 612143530605168 |
10 | 140414200030331 |
11 | 408163673655a7 |
12 | 138b92675a218b |
13 | 6047004c25946 |
14 | 2696125356283 |
15 | 113776787b5db |
hex | 7fb4ba83a47b |
140414200030331 has 2 divisors, whose sum is σ = 140414200030332. Its totient is φ = 140414200030330.
The previous prime is 140414200030309. The next prime is 140414200030369. The reversal of 140414200030331 is 133030002414041.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140414200030331 is a prime.
It is a super-2 number, since 2×1404142000303312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 140414200030331.
It is not a weakly prime, because it can be changed into another prime (140414200030301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70207100015165 + 70207100015166.
It is an arithmetic number, because the mean of its divisors is an integer number (70207100015166).
Almost surely, 2140414200030331 is an apocalyptic number.
140414200030331 is a deficient number, since it is larger than the sum of its proper divisors (1).
140414200030331 is an equidigital number, since it uses as much as digits as its factorization.
140414200030331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 140414200030331 its reverse (133030002414041), we get a palindrome (273444202444372).
The spelling of 140414200030331 in words is "one hundred forty trillion, four hundred fourteen billion, two hundred million, thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •