Base | Representation |
---|---|
bin | 111110011100100010… |
… | …0000010000010010011 |
3 | 110211010202100010110101 |
4 | 1330321010002002103 |
5 | 4144114421010103 |
6 | 141334425113231 |
7 | 12455104422445 |
oct | 1747104020223 |
9 | 424122303411 |
10 | 134101344403 |
11 | 51965792964 |
12 | 21ba6328817 |
13 | c8517ba940 |
14 | 66c2080495 |
15 | 374ce56a1d |
hex | 1f39102093 |
134101344403 has 8 divisors (see below), whose sum is σ = 144419910768. Its totient is φ = 123783217824.
The previous prime is 134101344397. The next prime is 134101344407. The reversal of 134101344403 is 304443101431.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 134101344403 - 217 = 134101213331 is a prime.
It is a super-3 number, since 3×1341013444033 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134101344407) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 806076 + ... + 958102.
It is an arithmetic number, because the mean of its divisors is an integer number (18052488846).
Almost surely, 2134101344403 is an apocalyptic number.
134101344403 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
134101344403 is a deficient number, since it is larger than the sum of its proper divisors (10318566365).
134101344403 is a wasteful number, since it uses less digits than its factorization.
134101344403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219893.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 134101344403 its reverse (304443101431), we get a palindrome (438544445834).
The spelling of 134101344403 in words is "one hundred thirty-four billion, one hundred one million, three hundred forty-four thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •