Base | Representation |
---|---|
bin | 1111001000010101… |
… | …0000011000000001 |
3 | 101111001100202022000 |
4 | 3302011100120001 |
5 | 31304213322230 |
6 | 1511003134213 |
7 | 202434606051 |
oct | 36205203001 |
9 | 11431322260 |
10 | 4061464065 |
11 | 17a465507a |
12 | 954214369 |
13 | 4c9591b99 |
14 | 2a7593561 |
15 | 18b866b60 |
hex | f2150601 |
4061464065 has 32 divisors (see below), whose sum is σ = 7469366400. Its totient is φ = 2091418560.
The previous prime is 4061464013. The next prime is 4061464081. The reversal of 4061464065 is 5604641604.
4061464065 is a `hidden beast` number, since 4 + 0 + 6 + 1 + 4 + 640 + 6 + 5 = 666.
It is a de Polignac number, because none of the positive numbers 2k-4061464065 is a prime.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 514791 + ... + 522620.
It is an arithmetic number, because the mean of its divisors is an integer number (233417700).
Almost surely, 24061464065 is an apocalyptic number.
4061464065 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
4061464065 is a deficient number, since it is larger than the sum of its proper divisors (3407902335).
4061464065 is a wasteful number, since it uses less digits than its factorization.
4061464065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1037454 (or 1037448 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
The square root of 4061464065 is about 63729.6168590397. The cubic root of 4061464065 is about 1595.4904352960.
The spelling of 4061464065 in words is "four billion, sixty-one million, four hundred sixty-four thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •