Base | Representation |
---|---|
bin | 1010111000110… |
… | …1111011110101 |
3 | 10011221021122102 |
4 | 2232031323311 |
5 | 43142421013 |
6 | 4310511445 |
7 | 1063122035 |
oct | 256157365 |
9 | 104837572 |
10 | 45670133 |
11 | 23863713 |
12 | 13365585 |
13 | 9600662 |
14 | 60cb8c5 |
15 | 4021d58 |
hex | 2b8def5 |
45670133 has 2 divisors, whose sum is σ = 45670134. Its totient is φ = 45670132.
The previous prime is 45670117. The next prime is 45670147. The reversal of 45670133 is 33107654.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38663524 + 7006609 = 6218^2 + 2647^2 .
It is a cyclic number.
It is not a de Polignac number, because 45670133 - 24 = 45670117 is a prime.
It is a super-2 number, since 2×456701332 = 4171522096475378, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 45670096 and 45670105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45670733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22835066 + 22835067.
It is an arithmetic number, because the mean of its divisors is an integer number (22835067).
Almost surely, 245670133 is an apocalyptic number.
It is an amenable number.
45670133 is a deficient number, since it is larger than the sum of its proper divisors (1).
45670133 is an equidigital number, since it uses as much as digits as its factorization.
45670133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 29.
The square root of 45670133 is about 6757.9681117922. The cubic root of 45670133 is about 357.4462611777.
Adding to 45670133 its reverse (33107654), we get a palindrome (78777787).
The spelling of 45670133 in words is "forty-five million, six hundred seventy thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •