Base | Representation |
---|---|
bin | 111000110001001100010… |
… | …001101100010001111001 |
3 | 111210221110001201202112000 |
4 | 320301030101230101321 |
5 | 1002403433130323001 |
6 | 12144051210211213 |
7 | 551563066654230 |
oct | 70611421542171 |
9 | 14727401652460 |
10 | 3901110011001 |
11 | 12744a6999235 |
12 | 530089a23b09 |
13 | 223b47263548 |
14 | d6b598a5b17 |
15 | 6b724432a86 |
hex | 38c4c46c479 |
3901110011001 has 32 divisors (see below), whose sum is σ = 6614810561280. Its totient is φ = 2225912876928.
The previous prime is 3901110010957. The next prime is 3901110011083. The reversal of 3901110011001 is 1001100111093.
It is not a de Polignac number, because 3901110011001 - 27 = 3901110010873 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3901110010001) 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 31 ways as a sum of consecutive naturals, for example, 15116356 + ... + 15372261.
It is an arithmetic number, because the mean of its divisors is an integer number (206712830040).
Almost surely, 23901110011001 is an apocalyptic number.
It is an amenable number.
3901110011001 is a deficient number, since it is larger than the sum of its proper divisors (2713700550279).
3901110011001 is a wasteful number, since it uses less digits than its factorization.
3901110011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30489310 (or 30489304 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 18.
Adding to 3901110011001 its reverse (1001100111093), we get a palindrome (4902210122094).
The spelling of 3901110011001 in words is "three trillion, nine hundred one billion, one hundred ten million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •