Base | Representation |
---|---|
bin | 1111101010100100… |
… | …1000001010011101 |
3 | 101212001121110122112 |
4 | 3322221020022131 |
5 | 32103000212331 |
6 | 1533133323405 |
7 | 206130431012 |
oct | 37251101235 |
9 | 11761543575 |
10 | 4205085341 |
11 | 186872a946 |
12 | 994336565 |
13 | 5202695a2 |
14 | 2bc69b709 |
15 | 19928632b |
hex | faa4829d |
4205085341 has 8 divisors (see below), whose sum is σ = 4252289184. Its totient is φ = 4158028080.
The previous prime is 4205085277. The next prime is 4205085343. The reversal of 4205085341 is 1435805024.
4205085341 is digitally balanced in base 2, 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 4205085341 - 26 = 4205085277 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4205085298 and 4205085307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4205085343) 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, 21566 + ... + 94208.
It is an arithmetic number, because the mean of its divisors is an integer number (531536148).
Almost surely, 24205085341 is an apocalyptic number.
It is an amenable number.
4205085341 is a deficient number, since it is larger than the sum of its proper divisors (47203843).
4205085341 is a wasteful number, since it uses less digits than its factorization.
4205085341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73291.
The product of its (nonzero) digits is 19200, while the sum is 32.
The square root of 4205085341 is about 64846.6293726975. The cubic root of 4205085341 is about 1614.0795607556.
The spelling of 4205085341 in words is "four billion, two hundred five million, eighty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •