Base | Representation |
---|---|
bin | 1111110110111… |
… | …01011001001111 |
3 | 100021022111022000 |
4 | 13323131121033 |
5 | 233023334112 |
6 | 21111123343 |
7 | 3203500002 |
oct | 773353117 |
9 | 307274260 |
10 | 133027407 |
11 | 690aa507 |
12 | 38673553 |
13 | 21738756 |
14 | 1394b539 |
15 | ba2a7dc |
hex | 7edd64f |
133027407 has 8 divisors (see below), whose sum is σ = 197077680. Its totient is φ = 88684920.
The previous prime is 133027381. The next prime is 133027409. The reversal of 133027407 is 704720331.
It is not a de Polignac number, because 133027407 - 220 = 131978831 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 4926941 = 133027407 / (1 + 3 + 3 + 0 + 2 + 7 + 4 + 0 + 7).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133027409) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2463444 + ... + 2463497.
It is an arithmetic number, because the mean of its divisors is an integer number (24634710).
Almost surely, 2133027407 is an apocalyptic number.
133027407 is a deficient number, since it is larger than the sum of its proper divisors (64050273).
133027407 is an equidigital number, since it uses as much as digits as its factorization.
133027407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4926950 (or 4926944 counting only the distinct ones).
The product of its (nonzero) digits is 3528, while the sum is 27.
The square root of 133027407 is about 11533.7507776092. The cubic root of 133027407 is about 510.4819319911.
Adding to 133027407 its reverse (704720331), we get a palindrome (837747738).
The spelling of 133027407 in words is "one hundred thirty-three million, twenty-seven thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •