Base | Representation |
---|---|
bin | 1101000010100… |
… | …1100011000101 |
3 | 10210220211222201 |
4 | 3100221203011 |
5 | 103000234013 |
6 | 5232154501 |
7 | 1232623642 |
oct | 320514305 |
9 | 123824881 |
10 | 54696133 |
11 | 28969018 |
12 | 16398a31 |
13 | b440a9b |
14 | 739adc9 |
15 | 4c063dd |
hex | 34298c5 |
54696133 has 4 divisors (see below), whose sum is σ = 54711360. Its totient is φ = 54680908.
The previous prime is 54696119. The next prime is 54696167. The reversal of 54696133 is 33169645.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 54696133 - 217 = 54565061 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 54696092 and 54696101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54696113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1098 + ... + 10516.
It is an arithmetic number, because the mean of its divisors is an integer number (13677840).
Almost surely, 254696133 is an apocalyptic number.
It is an amenable number.
54696133 is a deficient number, since it is larger than the sum of its proper divisors (15227).
54696133 is an equidigital number, since it uses as much as digits as its factorization.
54696133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15226.
The product of its digits is 58320, while the sum is 37.
The square root of 54696133 is about 7395.6834031751. The cubic root of 54696133 is about 379.5935936698.
The spelling of 54696133 in words is "fifty-four million, six hundred ninety-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •