Base | Representation |
---|---|
bin | 11110100011110010110111… |
… | …111010100111101111101111 |
3 | 122121212121222212110200010201 |
4 | 132203302313322213233233 |
5 | 120104012130232132421 |
6 | 1153503020540014331 |
7 | 40211111040306304 |
oct | 3643626772475757 |
9 | 577777885420121 |
10 | 134401202224111 |
11 | 39908258906a39 |
12 | 130a7a2a8313a7 |
13 | 59cbc95ab1864 |
14 | 25290a520d0ab |
15 | 108113c776b91 |
hex | 7a3cb7ea7bef |
134401202224111 has 2 divisors, whose sum is σ = 134401202224112. Its totient is φ = 134401202224110.
The previous prime is 134401202224033. The next prime is 134401202224141. The reversal of 134401202224111 is 111422202104431.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 134401202224111 - 237 = 134263763270639 is a prime.
It is a super-2 number, since 2×1344012022241112 (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 134401202224111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134401202224141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67200601112055 + 67200601112056.
It is an arithmetic number, because the mean of its divisors is an integer number (67200601112056).
Almost surely, 2134401202224111 is an apocalyptic number.
134401202224111 is a deficient number, since it is larger than the sum of its proper divisors (1).
134401202224111 is an equidigital number, since it uses as much as digits as its factorization.
134401202224111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 134401202224111 its reverse (111422202104431), we get a palindrome (245823404328542).
The spelling of 134401202224111 in words is "one hundred thirty-four trillion, four hundred one billion, two hundred two million, two hundred twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •