Base | Representation |
---|---|
bin | 10000000000110… |
… | …11100001010111 |
3 | 100100202200202001 |
4 | 20000123201113 |
5 | 233342033310 |
6 | 21155100131 |
7 | 3220534660 |
oct | 1000334127 |
9 | 310680661 |
10 | 134330455 |
11 | 6990a506 |
12 | 38ba1647 |
13 | 21aa389c |
14 | 13baa367 |
15 | bbd693a |
hex | 801b857 |
134330455 has 8 divisors (see below), whose sum is σ = 184224672. Its totient is φ = 92112288.
The previous prime is 134330453. The next prime is 134330467. The reversal of 134330455 is 554033431.
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 134330455 - 21 = 134330453 is a prime.
It is a super-2 number, since 2×1343304552 = 36089342281014050, which contains 22 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 (134330453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1918972 + ... + 1919041.
It is an arithmetic number, because the mean of its divisors is an integer number (23028084).
Almost surely, 2134330455 is an apocalyptic number.
134330455 is a deficient number, since it is larger than the sum of its proper divisors (49894217).
134330455 is an equidigital number, since it uses as much as digits as its factorization.
134330455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3838025.
The product of its (nonzero) digits is 10800, while the sum is 28.
The square root of 134330455 is about 11590.1015957583. The cubic root of 134330455 is about 512.1432996821.
Adding to 134330455 its reverse (554033431), we get a palindrome (688363886).
The spelling of 134330455 in words is "one hundred thirty-four million, three hundred thirty thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •