Base | Representation |
---|---|
bin | 1110111010001010… |
… | …1011100001010101 |
3 | 101022220121010222200 |
4 | 3232202223201111 |
5 | 31144012143230 |
6 | 1501042115113 |
7 | 201114010245 |
oct | 35642534125 |
9 | 11286533880 |
10 | 4002068565 |
11 | 1774077390 |
12 | 93834ba99 |
13 | 4ba197111 |
14 | 29d731b25 |
15 | 186533160 |
hex | ee8ab855 |
4002068565 has 48 divisors (see below), whose sum is σ = 7728604416. Its totient is φ = 1899100800.
The previous prime is 4002068537. The next prime is 4002068569. The reversal of 4002068565 is 5658602004.
It is not a de Polignac number, because 4002068565 - 25 = 4002068533 is a prime.
It is a super-2 number, since 2×40020685652 = 32033105597922318450, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4002068569) 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 in 47 ways as a sum of consecutive naturals, for example, 62746 + ... + 109275.
It is an arithmetic number, because the mean of its divisors is an integer number (161012592).
Almost surely, 24002068565 is an apocalyptic number.
4002068565 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
4002068565 is a deficient number, since it is larger than the sum of its proper divisors (3726535851).
4002068565 is a wasteful number, since it uses less digits than its factorization.
4002068565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172090 (or 172087 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
The square root of 4002068565 is about 63261.9045318745. The cubic root of 4002068565 is about 1587.6746416669.
The spelling of 4002068565 in words is "four billion, two million, sixty-eight thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •