Base | Representation |
---|---|
bin | 111110100110011101… |
… | …0111011101010001011 |
3 | 110211222222020100120001 |
4 | 1331030322323222023 |
5 | 4200310213101212 |
6 | 141431445543431 |
7 | 12466261265266 |
oct | 1751472735213 |
9 | 424888210501 |
10 | 134434503307 |
11 | 520168550a5 |
12 | 22079a14b77 |
13 | c8a58284a0 |
14 | 6714405cdd |
15 | 376c315657 |
hex | 1f4cebba8b |
134434503307 has 8 divisors (see below), whose sum is σ = 147855951936. Its totient is φ = 121453102272.
The previous prime is 134434503239. The next prime is 134434503349. The reversal of 134434503307 is 703305434431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134434503307 is a prime.
It is a super-3 number, since 3×1344345033073 (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 (134434503367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110011258 + ... + 110012479.
It is an arithmetic number, because the mean of its divisors is an integer number (18481993992).
Almost surely, 2134434503307 is an apocalyptic number.
134434503307 is a deficient number, since it is larger than the sum of its proper divisors (13421448629).
134434503307 is a wasteful number, since it uses less digits than its factorization.
134434503307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220023797.
The product of its (nonzero) digits is 181440, while the sum is 37.
Adding to 134434503307 its reverse (703305434431), we get a palindrome (837739937738).
The spelling of 134434503307 in words is "one hundred thirty-four billion, four hundred thirty-four million, five hundred three thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •