Base | Representation |
---|---|
bin | 1010111000101… |
… | …1011101110111 |
3 | 10011220202202222 |
4 | 2232023131313 |
5 | 43142110043 |
6 | 4310352555 |
7 | 1063050413 |
oct | 256133567 |
9 | 104822688 |
10 | 45660023 |
11 | 23857062 |
12 | 1335b75b |
13 | 95c8b86 |
14 | 60c7d43 |
15 | 401dd68 |
hex | 2b8b777 |
45660023 has 8 divisors (see below), whose sum is σ = 47140368. Its totient is φ = 44198784.
The previous prime is 45660001. The next prime is 45660047. The reversal of 45660023 is 32006654.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 45660023 - 26 = 45659959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 45659974 and 45660001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45660053) 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 in 7 ways as a sum of consecutive naturals, for example, 161 + ... + 9557.
It is an arithmetic number, because the mean of its divisors is an integer number (5892546).
Almost surely, 245660023 is an apocalyptic number.
45660023 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
45660023 is a deficient number, since it is larger than the sum of its proper divisors (1480345).
45660023 is a wasteful number, since it uses less digits than its factorization.
45660023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9553.
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 45660023 is about 6757.2200644940. The cubic root of 45660023 is about 357.4198832646.
Adding to 45660023 its reverse (32006654), we get a palindrome (77666677).
The spelling of 45660023 in words is "forty-five million, six hundred sixty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •