Base | Representation |
---|---|
bin | 1000011001011101… |
… | …11110110110011001 |
3 | 102122012202010010112 |
4 | 10030232332312121 |
5 | 33213201004240 |
6 | 2023215054105 |
7 | 216504360260 |
oct | 41456766631 |
9 | 12565663115 |
10 | 4508609945 |
11 | 1a03aa1424 |
12 | a59b11335 |
13 | 56b0cc748 |
14 | 30ab0b5d7 |
15 | 1b5c3e665 |
hex | 10cbbed99 |
4508609945 has 8 divisors (see below), whose sum is σ = 6183236544. Its totient is φ = 3091618224.
The previous prime is 4508609929. The next prime is 4508609957. The reversal of 4508609945 is 5499068054.
4508609945 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 4508609945 - 24 = 4508609929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4508609893 and 4508609902.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64408679 + ... + 64408748.
It is an arithmetic number, because the mean of its divisors is an integer number (772904568).
Almost surely, 24508609945 is an apocalyptic number.
It is an amenable number.
4508609945 is a deficient number, since it is larger than the sum of its proper divisors (1674626599).
4508609945 is a wasteful number, since it uses less digits than its factorization.
4508609945 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128817439.
The product of its (nonzero) digits is 1555200, while the sum is 50.
The square root of 4508609945 is about 67146.1833986117. The cubic root of 4508609945 is about 1652.0158948075.
The spelling of 4508609945 in words is "four billion, five hundred eight million, six hundred nine thousand, nine hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •