Base | Representation |
---|---|
bin | 1110001001001101… |
… | …0001101100000001 |
3 | 100210121011112202201 |
4 | 3202103101230001 |
5 | 30233424012001 |
6 | 1424424313201 |
7 | 163041310606 |
oct | 34223215401 |
9 | 10717145681 |
10 | 3796704001 |
11 | 167915aa02 |
12 | 89b612801 |
13 | 48678211c |
14 | 2803546ad |
15 | 1734b9501 |
hex | e24d1b01 |
3796704001 has 4 divisors (see below), whose sum is σ = 3961778112. Its totient is φ = 3631629892.
The previous prime is 3796703923. The next prime is 3796704007. The reversal of 3796704001 is 1004076973.
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 3796704001 - 29 = 3796703489 is a prime.
It is a super-2 number, since 2×37967040012 = 28829922542418816002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3796704007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82537021 + ... + 82537066.
It is an arithmetic number, because the mean of its divisors is an integer number (990444528).
Almost surely, 23796704001 is an apocalyptic number.
It is an amenable number.
3796704001 is a deficient number, since it is larger than the sum of its proper divisors (165074111).
3796704001 is a wasteful number, since it uses less digits than its factorization.
3796704001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165074110.
The product of its (nonzero) digits is 31752, while the sum is 37.
The square root of 3796704001 is about 61617.4001480101. The cubic root of 3796704001 is about 1560.0394468712.
The spelling of 3796704001 in words is "three billion, seven hundred ninety-six million, seven hundred four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •