Base | Representation |
---|---|
bin | 1011010000000010001… |
… | …01010100000111010001 |
3 | 1100221210101200012001012 |
4 | 11220001011110013101 |
5 | 22313141144230321 |
6 | 453330254220305 |
7 | 36633306133334 |
oct | 5500105240721 |
9 | 1327711605035 |
10 | 386565226961 |
11 | 139a39aa1591 |
12 | 62b03ab4695 |
13 | 2a5b71716b4 |
14 | 149d1bc061b |
15 | a0c721505b |
hex | 5a011541d1 |
386565226961 has 8 divisors (see below), whose sum is σ = 407525182464. Its totient is φ = 366135903360.
The previous prime is 386565226939. The next prime is 386565226967. The reversal of 386565226961 is 169622565683.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-386565226961 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 386565226961.
It is not an unprimeable number, because it can be changed into a prime (386565226967) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 132656480 + ... + 132659393.
It is an arithmetic number, because the mean of its divisors is an integer number (50940647808).
Almost surely, 2386565226961 is an apocalyptic number.
386565226961 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
386565226961 is a deficient number, since it is larger than the sum of its proper divisors (20959955503).
386565226961 is a wasteful number, since it uses less digits than its factorization.
386565226961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 265315951.
The product of its digits is 27993600, while the sum is 59.
The spelling of 386565226961 in words is "three hundred eighty-six billion, five hundred sixty-five million, two hundred twenty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •