Base | Representation |
---|---|
bin | 1110100011011110… |
… | …1010111101100001 |
3 | 101002021112111020100 |
4 | 3220313222331201 |
5 | 31000132024001 |
6 | 1443402333013 |
7 | 165550112223 |
oct | 35067527541 |
9 | 11067474210 |
10 | 3906908001 |
11 | 1725390897 |
12 | 9104ba169 |
13 | 4a35592a9 |
14 | 290c40413 |
15 | 17ced7586 |
hex | e8deaf61 |
3906908001 has 12 divisors (see below), whose sum is σ = 5662575828. Its totient is φ = 2595714144.
The previous prime is 3906907993. The next prime is 3906908009. The reversal of 3906908001 is 1008096093.
It is an interprime number because it is at equal distance from previous prime (3906907993) and next prime (3906908009).
It can be written as a sum of positive squares in 2 ways, for example, as 3835944225 + 70963776 = 61935^2 + 8424^2 .
It is not a de Polignac number, because 3906908001 - 23 = 3906907993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3906908009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 738150 + ... + 743423.
It is an arithmetic number, because the mean of its divisors is an integer number (471881319).
Almost surely, 23906908001 is an apocalyptic number.
It is an amenable number.
3906908001 is a deficient number, since it is larger than the sum of its proper divisors (1755667827).
3906908001 is a wasteful number, since it uses less digits than its factorization.
3906908001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1481872 (or 1481869 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 36.
The square root of 3906908001 is about 62505.2637863404. The cubic root of 3906908001 is about 1574.9897371969.
The spelling of 3906908001 in words is "three billion, nine hundred six million, nine hundred eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •