Base | Representation |
---|---|
bin | 1111001010111010… |
… | …1000001110100101 |
3 | 101111210202202200001 |
4 | 3302232220032211 |
5 | 31320002402134 |
6 | 1512031421301 |
7 | 202626026641 |
oct | 36256501645 |
9 | 11453682601 |
10 | 4072309669 |
11 | 17aa79258a |
12 | 957984831 |
13 | 4cb8bb5bc |
14 | 2a8bb7c21 |
15 | 18c7aa414 |
hex | f2ba83a5 |
4072309669 has 2 divisors, whose sum is σ = 4072309670. Its totient is φ = 4072309668.
The previous prime is 4072309667. The next prime is 4072309723. The reversal of 4072309669 is 9669032704.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3839289444 + 233020225 = 61962^2 + 15265^2 .
It is a cyclic number.
It is not a de Polignac number, because 4072309669 - 21 = 4072309667 is a prime.
It is a super-2 number, since 2×40723096692 = 33167412080461779122, which contains 22 as substring.
Together with 4072309667, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4072309667) 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 as a sum of consecutive naturals, namely, 2036154834 + 2036154835.
It is an arithmetic number, because the mean of its divisors is an integer number (2036154835).
Almost surely, 24072309669 is an apocalyptic number.
It is an amenable number.
4072309669 is a deficient number, since it is larger than the sum of its proper divisors (1).
4072309669 is an equidigital number, since it uses as much as digits as its factorization.
4072309669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 489888, while the sum is 46.
The square root of 4072309669 is about 63814.6508961696. The cubic root of 4072309669 is about 1596.9093552754.
The spelling of 4072309669 in words is "four billion, seventy-two million, three hundred nine thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •