Base | Representation |
---|---|
bin | 1111001011111101… |
… | …0001110000010001 |
3 | 101112002222111111100 |
4 | 3302333101300101 |
5 | 31322112032230 |
6 | 1512305135013 |
7 | 203011105062 |
oct | 36277216021 |
9 | 11462874440 |
10 | 4076674065 |
11 | 18021a3622 |
12 | 95932a469 |
13 | 4cc788c99 |
14 | 2a95d2569 |
15 | 18cd6d660 |
hex | f2fd1c11 |
4076674065 has 96 divisors (see below), whose sum is σ = 7464877056. Its totient is φ = 2055536640.
The previous prime is 4076674037. The next prime is 4076674073. The reversal of 4076674065 is 5604766704.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-4076674065 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 4076674065.
It is an unprimeable number.
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 95 ways as a sum of consecutive naturals, for example, 15862417 + ... + 15862673.
It is an arithmetic number, because the mean of its divisors is an integer number (77759136).
Almost surely, 24076674065 is an apocalyptic number.
4076674065 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
4076674065 is a deficient number, since it is larger than the sum of its proper divisors (3388202991).
4076674065 is a wasteful number, since it uses less digits than its factorization.
4076674065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519 (or 516 counting only the distinct ones).
The product of its (nonzero) digits is 846720, while the sum is 45.
The square root of 4076674065 is about 63848.8376166708. The cubic root of 4076674065 is about 1597.4796341456.
The spelling of 4076674065 in words is "four billion, seventy-six million, six hundred seventy-four thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •