Base | Representation |
---|---|
bin | 111110100101011101… |
… | …1100111111101011101 |
3 | 110211220122102211102222 |
4 | 1331022323213331131 |
5 | 4200223142132313 |
6 | 141424254355125 |
7 | 12465404521061 |
oct | 1751273477535 |
9 | 424818384388 |
10 | 134401130333 |
11 | 51aa9a30528 |
12 | 2206a7bbaa5 |
13 | c89b942172 |
14 | 670dbd9aa1 |
15 | 3769422208 |
hex | 1f4aee7f5d |
134401130333 has 4 divisors (see below), whose sum is σ = 134605078080. Its totient is φ = 134197182588.
The previous prime is 134401130327. The next prime is 134401130387. The reversal of 134401130333 is 333031104431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 134401130333 - 24 = 134401130317 is a prime.
It is a super-3 number, since 3×1344011303333 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134401130533) 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, 101972885 + ... + 101974202.
It is an arithmetic number, because the mean of its divisors is an integer number (33651269520).
Almost surely, 2134401130333 is an apocalyptic number.
It is an amenable number.
134401130333 is a deficient number, since it is larger than the sum of its proper divisors (203947747).
134401130333 is an equidigital number, since it uses as much as digits as its factorization.
134401130333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 203947746.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 134401130333 its reverse (333031104431), we get a palindrome (467432234764).
The spelling of 134401130333 in words is "one hundred thirty-four billion, four hundred one million, one hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •