Base | Representation |
---|---|
bin | 10010101010100010101… |
… | …00010111110101100011 |
3 | 2021022100022020011011021 |
4 | 21111101110113311203 |
5 | 41001402443001430 |
6 | 1210341001430311 |
7 | 64222240434163 |
oct | 11252124276543 |
9 | 2238308204137 |
10 | 641314422115 |
11 | 227a862aa404 |
12 | a435aa9b397 |
13 | 48625127323 |
14 | 2307b2485a3 |
15 | 11a36e4307a |
hex | 9551517d63 |
641314422115 has 4 divisors (see below), whose sum is σ = 769577306544. Its totient is φ = 513051537688.
The previous prime is 641314422101. The next prime is 641314422121. The reversal of 641314422115 is 511224413146.
It is a happy number.
641314422115 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 511224413146 = 2 ⋅255612206573.
It is a cyclic number.
It is not a de Polignac number, because 641314422115 - 27 = 641314421987 is a prime.
It is a super-2 number, since 2×6413144221152 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64131442207 + ... + 64131442216.
It is an arithmetic number, because the mean of its divisors is an integer number (192394326636).
Almost surely, 2641314422115 is an apocalyptic number.
641314422115 is a deficient number, since it is larger than the sum of its proper divisors (128262884429).
641314422115 is a wasteful number, since it uses less digits than its factorization.
641314422115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128262884428.
The product of its digits is 23040, while the sum is 34.
The spelling of 641314422115 in words is "six hundred forty-one billion, three hundred fourteen million, four hundred twenty-two thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •