Base | Representation |
---|---|
bin | 1111111111001… |
… | …00010101110000 |
3 | 100100100012200211 |
4 | 13333210111300 |
5 | 233312320212 |
6 | 21150153504 |
7 | 3215604010 |
oct | 777442560 |
9 | 310305624 |
10 | 134104432 |
11 | 69775710 |
12 | 38ab2894 |
13 | 21a24a47 |
14 | 13b4bc40 |
15 | bb8e9a7 |
hex | 7fe4570 |
134104432 has 160 divisors (see below), whose sum is σ = 362119680. Its totient is φ = 46448640.
The previous prime is 134104423. The next prime is 134104433. The reversal of 134104432 is 234401431.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134104433) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 397768 + ... + 398104.
It is an arithmetic number, because the mean of its divisors is an integer number (2263248).
Almost surely, 2134104432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 134104432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181059840).
134104432 is an abundant number, since it is smaller than the sum of its proper divisors (228015248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134104432 is a wasteful number, since it uses less digits than its factorization.
134104432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 399 (or 393 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 134104432 is about 11580.3467996429. The cubic root of 134104432 is about 511.8558961316.
Adding to 134104432 its reverse (234401431), we get a palindrome (368505863).
The spelling of 134104432 in words is "one hundred thirty-four million, one hundred four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •