Base | Representation |
---|---|
bin | 1111111111111… |
… | …01001100000111 |
3 | 100100112101022120 |
4 | 13333331030013 |
5 | 233324044330 |
6 | 21152301023 |
7 | 3216506523 |
oct | 777751407 |
9 | 310471276 |
10 | 134206215 |
11 | 69835130 |
12 | 38b41773 |
13 | 21a5c180 |
14 | 13b76d83 |
15 | bbaec10 |
hex | 7ffd307 |
134206215 has 128 divisors (see below), whose sum is σ = 275788800. Its totient is φ = 54743040.
The previous prime is 134206207. The next prime is 134206231. The reversal of 134206215 is 512602431.
It is not a de Polignac number, because 134206215 - 23 = 134206207 is a prime.
It is a super-2 number, since 2×1342062152 = 36022616289252450, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1507891 + ... + 1507979.
It is an arithmetic number, because the mean of its divisors is an integer number (2154600).
Almost surely, 2134206215 is an apocalyptic number.
134206215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
134206215 is an abundant number, since it is smaller than the sum of its proper divisors (141582585).
134206215 is a wasteful number, since it uses less digits than its factorization.
134206215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177.
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 134206215 is about 11584.7406099576. The cubic root of 134206215 is about 511.9853600449.
Adding to 134206215 its reverse (512602431), we get a palindrome (646808646).
It can be divided in two parts, 134206 and 215, that added together give a triangular number (134421 = T518).
The spelling of 134206215 in words is "one hundred thirty-four million, two hundred six thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •