Base | Representation |
---|---|
bin | 1111111001010… |
… | …00000000100111 |
3 | 100021220000112102 |
4 | 13330220000213 |
5 | 233113124111 |
6 | 21121442315 |
7 | 3206212016 |
oct | 774500047 |
9 | 307800472 |
10 | 133333031 |
11 | 69299097 |
12 | 387a039b |
13 | 218148b0 |
14 | 139caa7d |
15 | ba8b13b |
hex | 7f28027 |
133333031 has 12 divisors (see below), whose sum is σ = 146741112. Its totient is φ = 120432048.
The previous prime is 133333027. The next prime is 133333037. The reversal of 133333031 is 130333331.
It is not a de Polignac number, because 133333031 - 22 = 133333027 is a prime.
It is a super-2 number, since 2×1333330312 = 35555394311293922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133332994 and 133333012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133333037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26396 + ... + 31038.
It is an arithmetic number, because the mean of its divisors is an integer number (12228426).
Almost surely, 2133333031 is an apocalyptic number.
133333031 is a deficient number, since it is larger than the sum of its proper divisors (13408081).
133333031 is an equidigital number, since it uses as much as digits as its factorization.
133333031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4750 (or 4703 counting only the distinct ones).
The product of its (nonzero) digits is 729, while the sum is 20.
The square root of 133333031 is about 11546.9922923677. The cubic root of 133333031 is about 510.8725687939.
Adding to 133333031 its reverse (130333331), we get a palindrome (263666362).
The spelling of 133333031 in words is "one hundred thirty-three million, three hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •