Base | Representation |
---|---|
bin | 1111001000001001… |
… | …0111010010011001 |
3 | 101110222221020100111 |
4 | 3302002113102121 |
5 | 31304020042240 |
6 | 1510535004321 |
7 | 202425300562 |
oct | 36202272231 |
9 | 11428836314 |
10 | 4060705945 |
11 | 17a418752a |
12 | 953b096a1 |
13 | 4c9387aaa |
14 | 2a7437169 |
15 | 18b7671ea |
hex | f2097499 |
4060705945 has 4 divisors (see below), whose sum is σ = 4872847140. Its totient is φ = 3248564752.
The previous prime is 4060705937. The next prime is 4060705993. The reversal of 4060705945 is 5495070604.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1632483216 + 2428222729 = 40404^2 + 49277^2 .
It is a cyclic number.
It is not a de Polignac number, because 4060705945 - 23 = 4060705937 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 4060705898 and 4060705907.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 406070590 + ... + 406070599.
It is an arithmetic number, because the mean of its divisors is an integer number (1218211785).
Almost surely, 24060705945 is an apocalyptic number.
It is an amenable number.
4060705945 is a deficient number, since it is larger than the sum of its proper divisors (812141195).
4060705945 is an equidigital number, since it uses as much as digits as its factorization.
4060705945 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 812141194.
The product of its (nonzero) digits is 151200, while the sum is 40.
The square root of 4060705945 is about 63723.6686404667. The cubic root of 4060705945 is about 1595.3911567716.
The spelling of 4060705945 in words is "four billion, sixty million, seven hundred five thousand, nine hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •