Base | Representation |
---|---|
bin | 10000000001001… |
… | …00010000000111 |
3 | 100100211111210111 |
4 | 20000210100013 |
5 | 233344204330 |
6 | 21155533451 |
7 | 3221044144 |
oct | 1000442007 |
9 | 310744714 |
10 | 134366215 |
11 | 69934365 |
12 | 38bba287 |
13 | 21ab6c49 |
14 | 13bb93cb |
15 | bbe232a |
hex | 8024407 |
134366215 has 12 divisors (see below), whose sum is σ = 171283896. Its totient is φ = 101168768.
The previous prime is 134366191. The next prime is 134366231. The reversal of 134366215 is 512663431.
It is not a de Polignac number, because 134366215 - 27 = 134366087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45049 + ... + 47938.
It is an arithmetic number, because the mean of its divisors is an integer number (14273658).
Almost surely, 2134366215 is an apocalyptic number.
134366215 is a deficient number, since it is larger than the sum of its proper divisors (36917681).
134366215 is an equidigital number, since it uses as much as digits as its factorization.
134366215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93026 (or 93009 counting only the distinct ones).
The product of its digits is 12960, while the sum is 31.
The square root of 134366215 is about 11591.6441888112. The cubic root of 134366215 is about 512.1887413990.
The spelling of 134366215 in words is "one hundred thirty-four million, three hundred sixty-six thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •