Base | Representation |
---|---|
bin | 1110111011010000… |
… | …1101101000011101 |
3 | 101100020020122202010 |
4 | 3232310031220131 |
5 | 31201201232413 |
6 | 1501324421433 |
7 | 201201042201 |
oct | 35664155035 |
9 | 11306218663 |
10 | 4006664733 |
11 | 1776726575 |
12 | 9399a7879 |
13 | 4bb116146 |
14 | 2a01aab01 |
15 | 186b3edc3 |
hex | eed0da1d |
4006664733 has 4 divisors (see below), whose sum is σ = 5342219648. Its totient is φ = 2671109820.
The previous prime is 4006664731. The next prime is 4006664741. The reversal of 4006664733 is 3374666004.
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 not a de Polignac number, because 4006664733 - 21 = 4006664731 is a prime.
It is a super-2 number, since 2×40066647332 = 32106724565331922578, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4006664691 and 4006664700.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4006664731) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 667777453 + ... + 667777458.
It is an arithmetic number, because the mean of its divisors is an integer number (1335554912).
Almost surely, 24006664733 is an apocalyptic number.
It is an amenable number.
4006664733 is a deficient number, since it is larger than the sum of its proper divisors (1335554915).
4006664733 is a wasteful number, since it uses less digits than its factorization.
4006664733 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1335554914.
The product of its (nonzero) digits is 217728, while the sum is 39.
The square root of 4006664733 is about 63298.2206148009. The cubic root of 4006664733 is about 1588.2821964478.
The spelling of 4006664733 in words is "four billion, six million, six hundred sixty-four thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •