Base | Representation |
---|---|
bin | 1111111111111… |
… | …11011011101101 |
3 | 100100112211220221 |
4 | 13333333123231 |
5 | 233324343110 |
6 | 21152411341 |
7 | 3216545362 |
oct | 777773355 |
9 | 310484827 |
10 | 134215405 |
11 | 69841025 |
12 | 38b46b51 |
13 | 21a633cc |
14 | 13b7a469 |
15 | bbb27da |
hex | 7fff6ed |
134215405 has 8 divisors (see below), whose sum is σ = 163462752. Its totient is φ = 105769488.
The previous prime is 134215379. The next prime is 134215429. The reversal of 134215405 is 504512431.
It is a happy number.
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 134215405 - 29 = 134214893 is a prime.
It is a Duffinian number.
It is a zygodrome in base 8.
It is a self number, because there is not a number n which added to its sum of digits gives 134215405.
It is a congruent number.
It is an unprimeable number.
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, 199987 + ... + 200656.
It is an arithmetic number, because the mean of its divisors is an integer number (20432844).
Almost surely, 2134215405 is an apocalyptic number.
It is an amenable number.
134215405 is a deficient number, since it is larger than the sum of its proper divisors (29247347).
134215405 is an equidigital number, since it uses as much as digits as its factorization.
134215405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400715.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 134215405 is about 11585.1372456264. The cubic root of 134215405 is about 511.9970461357.
Adding to 134215405 its reverse (504512431), we get a palindrome (638727836).
The spelling of 134215405 in words is "one hundred thirty-four million, two hundred fifteen thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •