Base | Representation |
---|---|
bin | 100000001001101011001011… |
… | …111010001101111111010011 |
3 | 200112122221010210201212200212 |
4 | 200021223023322031333103 |
5 | 122013213440043333121 |
6 | 1220423200255034335 |
7 | 41532660443446043 |
oct | 4011531372157723 |
9 | 615587123655625 |
10 | 141402334355411 |
11 | 41067436435288 |
12 | 13a3887780b9ab |
13 | 60b924bb2ac5c |
14 | 26cbca3949723 |
15 | 11532ec55725b |
hex | 809acbe8dfd3 |
141402334355411 has 12 divisors (see below), whose sum is σ = 149256618366024. Its totient is φ = 133941830623200.
The previous prime is 141402334355407. The next prime is 141402334355413. The reversal of 141402334355411 is 114553433204141.
It is not a de Polignac number, because 141402334355411 - 22 = 141402334355407 is a prime.
It is a super-2 number, since 2×1414023343554112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141402334355413) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24068570 + ... + 29361551.
It is an arithmetic number, because the mean of its divisors is an integer number (12438051530502).
Almost surely, 2141402334355411 is an apocalyptic number.
141402334355411 is a deficient number, since it is larger than the sum of its proper divisors (7854284010613).
141402334355411 is an equidigital number, since it uses as much as digits as its factorization.
141402334355411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53437490 (or 53437471 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 41.
Adding to 141402334355411 its reverse (114553433204141), we get a palindrome (255955767559552).
The spelling of 141402334355411 in words is "one hundred forty-one trillion, four hundred two billion, three hundred thirty-four million, three hundred fifty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •