Base | Representation |
---|---|
bin | 1111001000011011… |
… | …1111001100010001 |
3 | 101111002012210221021 |
4 | 3302012333030101 |
5 | 31304322333334 |
6 | 1511020555441 |
7 | 202441506304 |
oct | 36206771421 |
9 | 11432183837 |
10 | 4061917969 |
11 | 17a49350aa |
12 | 9543b2b81 |
13 | 4c96c0675 |
14 | 2a7670b3b |
15 | 18b9063b4 |
hex | f21bf311 |
4061917969 has 4 divisors (see below), whose sum is σ = 4088818240. Its totient is φ = 4035017700.
The previous prime is 4061917963. The next prime is 4061917997. The reversal of 4061917969 is 9697191604.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4061917969 - 27 = 4061917841 is a prime.
It is a super-2 number, since 2×40619179692 = 32998355173770169922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4061917963) 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 3 ways as a sum of consecutive naturals, for example, 13449909 + ... + 13450210.
It is an arithmetic number, because the mean of its divisors is an integer number (1022204560).
Almost surely, 24061917969 is an apocalyptic number.
It is an amenable number.
4061917969 is a deficient number, since it is larger than the sum of its proper divisors (26900271).
4061917969 is a wasteful number, since it uses less digits than its factorization.
4061917969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26900270.
The product of its (nonzero) digits is 734832, while the sum is 52.
The square root of 4061917969 is about 63733.1779295525. The cubic root of 4061917969 is about 1595.5498697349.
The spelling of 4061917969 in words is "four billion, sixty-one million, nine hundred seventeen thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •