Base | Representation |
---|---|
bin | 1010111011000… |
… | …0111110000001 |
3 | 10012012120111020 |
4 | 2232300332001 |
5 | 43212014013 |
6 | 4313540053 |
7 | 1064260305 |
oct | 256607601 |
9 | 105176436 |
10 | 45813633 |
11 | 23951508 |
12 | 13414629 |
13 | 9650a78 |
14 | 6127d05 |
15 | 404e623 |
hex | 2bb0f81 |
45813633 has 4 divisors (see below), whose sum is σ = 61084848. Its totient is φ = 30542420.
The previous prime is 45813613. The next prime is 45813637. The reversal of 45813633 is 33631854.
45813633 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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.
It is a cyclic number.
It is not a de Polignac number, because 45813633 - 214 = 45797249 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 45813594 and 45813603.
It is not an unprimeable number, because it can be changed into a prime (45813637) 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 3 ways as a sum of consecutive naturals, for example, 7635603 + ... + 7635608.
It is an arithmetic number, because the mean of its divisors is an integer number (15271212).
Almost surely, 245813633 is an apocalyptic number.
It is an amenable number.
45813633 is a deficient number, since it is larger than the sum of its proper divisors (15271215).
45813633 is a wasteful number, since it uses less digits than its factorization.
45813633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15271214.
The product of its digits is 25920, while the sum is 33.
The square root of 45813633 is about 6768.5768814427. The cubic root of 45813633 is about 357.8202467243.
The spelling of 45813633 in words is "forty-five million, eight hundred thirteen thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.182 sec. • engine limits •