Base | Representation |
---|---|
bin | 1000011001001101… |
… | …00111010011010101 |
3 | 102122001121200001221 |
4 | 10030212213103111 |
5 | 33212120310331 |
6 | 2023100050341 |
7 | 216446623030 |
oct | 41446472325 |
9 | 12561550057 |
10 | 4506416341 |
11 | 1a02833329 |
12 | a592339b1 |
13 | 56a81215b |
14 | 30a6da017 |
15 | 1b5959711 |
hex | 10c9a74d5 |
4506416341 has 8 divisors (see below), whose sum is σ = 5158082304. Its totient is φ = 3856723440.
The previous prime is 4506416323. The next prime is 4506416347. The reversal of 4506416341 is 1436146054.
4506416341 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 4506416341 - 25 = 4506416309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4506416297 and 4506416306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4506416347) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 488365 + ... + 497506.
It is an arithmetic number, because the mean of its divisors is an integer number (644760288).
Almost surely, 24506416341 is an apocalyptic number.
It is an amenable number.
4506416341 is a deficient number, since it is larger than the sum of its proper divisors (651665963).
4506416341 is an equidigital number, since it uses as much as digits as its factorization.
4506416341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 986531.
The product of its (nonzero) digits is 34560, while the sum is 34.
The square root of 4506416341 is about 67129.8468715667. The cubic root of 4506416341 is about 1651.7479292488.
The spelling of 4506416341 in words is "four billion, five hundred six million, four hundred sixteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •