Base | Representation |
---|---|
bin | 11110100001001010001000… |
… | …000001101001001011110011 |
3 | 122121020022022021120201020012 |
4 | 132201022020001221023303 |
5 | 120043030040043212321 |
6 | 1153243453232405135 |
7 | 40162034655035513 |
oct | 3641121001511363 |
9 | 577208267521205 |
10 | 134220010132211 |
11 | 3984842867a543 |
12 | 130788a19a67ab |
13 | 59b7b7b1b44b3 |
14 | 25203d6d81843 |
15 | 107b58559605b |
hex | 7a12880692f3 |
134220010132211 has 4 divisors (see below), whose sum is σ = 134220138564792. Its totient is φ = 134219881699632.
The previous prime is 134220010132193. The next prime is 134220010132213. The reversal of 134220010132211 is 112231010022431.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 134220010132211 - 210 = 134220010131187 is a prime.
It is a super-2 number, since 2×1342200101322112 (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 (134220010132213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62635730 + ... + 64743143.
It is an arithmetic number, because the mean of its divisors is an integer number (33555034641198).
Almost surely, 2134220010132211 is an apocalyptic number.
134220010132211 is a deficient number, since it is larger than the sum of its proper divisors (128432581).
134220010132211 is a wasteful number, since it uses less digits than its factorization.
134220010132211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128432580.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 134220010132211 its reverse (112231010022431), we get a palindrome (246451020154642).
The spelling of 134220010132211 in words is "one hundred thirty-four trillion, two hundred twenty billion, ten million, one hundred thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •