Base | Representation |
---|---|
bin | 111110011100110110… |
… | …1100100011111011001 |
3 | 110211011111211100101210 |
4 | 1330321231210133121 |
5 | 4144130212432213 |
6 | 141335454333333 |
7 | 12455266114053 |
oct | 1747155443731 |
9 | 424144740353 |
10 | 134112233433 |
11 | 5197094aa62 |
12 | 21ba9aba249 |
13 | c853b31059 |
14 | 66c36b68d3 |
15 | 374dda80c3 |
hex | 1f39b647d9 |
134112233433 has 8 divisors (see below), whose sum is σ = 186590933568. Its totient is φ = 85520844464.
The previous prime is 134112233401. The next prime is 134112233471. The reversal of 134112233433 is 334332211431.
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 134112233433 - 25 = 134112233401 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134112233433.
It is not an unprimeable number, because it can be changed into a prime (134112223433) 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, 971827710 + ... + 971827847.
It is an arithmetic number, because the mean of its divisors is an integer number (23323866696).
Almost surely, 2134112233433 is an apocalyptic number.
It is an amenable number.
134112233433 is a deficient number, since it is larger than the sum of its proper divisors (52478700135).
134112233433 is a wasteful number, since it uses less digits than its factorization.
134112233433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1943655583.
The product of its digits is 15552, while the sum is 30.
Adding to 134112233433 its reverse (334332211431), we get a palindrome (468444444864).
The spelling of 134112233433 in words is "one hundred thirty-four billion, one hundred twelve million, two hundred thirty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •