Base | Representation |
---|---|
bin | 111000110101110000011… |
… | …000000110110001111001 |
3 | 111211102002121010110222112 |
4 | 320311300120012301321 |
5 | 1002444002210430411 |
6 | 12150221351502105 |
7 | 552125404424636 |
oct | 70656030066171 |
9 | 14742077113875 |
10 | 3906010639481 |
11 | 12765911a3a15 |
12 | 531017087935 |
13 | 22444863b702 |
14 | d70a269b18d |
15 | 6b90e7aab8b |
hex | 38d70606c79 |
3906010639481 has 4 divisors (see below), whose sum is σ = 3914557709172. Its totient is φ = 3897463569792.
The previous prime is 3906010639469. The next prime is 3906010639501. The reversal of 3906010639481 is 1849360106093.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1358427546256 + 2547583093225 = 1165516^2 + 1596115^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3906010639481 is a prime.
It is a super-2 number, since 2×39060106394812 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3906010639411) 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, 4273534160 + ... + 4273535073.
It is an arithmetic number, because the mean of its divisors is an integer number (978639427293).
Almost surely, 23906010639481 is an apocalyptic number.
It is an amenable number.
3906010639481 is a deficient number, since it is larger than the sum of its proper divisors (8547069691).
3906010639481 is an equidigital number, since it uses as much as digits as its factorization.
3906010639481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8547069690.
The product of its (nonzero) digits is 839808, while the sum is 50.
The spelling of 3906010639481 in words is "three trillion, nine hundred six billion, ten million, six hundred thirty-nine thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •