Base | Representation |
---|---|
bin | 11110011101111101001111… |
… | …101010001011000101010011 |
3 | 122120110021110212110011120112 |
4 | 132131331033222023011103 |
5 | 120030424020401422121 |
6 | 1152554432044431535 |
7 | 40140116304233102 |
oct | 3635751752130523 |
9 | 576407425404515 |
10 | 134000021123411 |
11 | 397730a9607163 |
12 | 13042127b485ab |
13 | 59a01bc868481 |
14 | 25138c823a039 |
15 | 10759ac32775b |
hex | 79df4fa8b153 |
134000021123411 has 4 divisors (see below), whose sum is σ = 134182831521312. Its totient is φ = 133817210725512.
The previous prime is 134000021123363. The next prime is 134000021123417. The reversal of 134000021123411 is 114321120000431.
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 134000021123411 - 226 = 133999954014547 is a prime.
It is a super-2 number, since 2×1340000211234112 (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 (134000021123417) 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, 91405197851 + ... + 91405199316.
It is an arithmetic number, because the mean of its divisors is an integer number (33545707880328).
Almost surely, 2134000021123411 is an apocalyptic number.
134000021123411 is a deficient number, since it is larger than the sum of its proper divisors (182810397901).
134000021123411 is an equidigital number, since it uses as much as digits as its factorization.
134000021123411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182810397900.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 134000021123411 its reverse (114321120000431), we get a palindrome (248321141123842).
The spelling of 134000021123411 in words is "one hundred thirty-four trillion, twenty-one million, one hundred twenty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •