Base | Representation |
---|---|
bin | 10010110010100111100… |
… | …00000101000100100101 |
3 | 2021201112110202211220010 |
4 | 21121103300011010211 |
5 | 41034242423111023 |
6 | 1212335124400433 |
7 | 64434546131400 |
oct | 11312360050445 |
9 | 2251473684803 |
10 | 645650207013 |
11 | 229900789809 |
12 | a516ab46119 |
13 | 48b66495916 |
14 | 2336d008d37 |
15 | 11bdc8e5093 |
hex | 9653c05125 |
645650207013 has 24 divisors (see below), whose sum is σ = 1044956507328. Its totient is φ = 352901974656.
The previous prime is 645650207011. The next prime is 645650207021. The reversal of 645650207013 is 310702056546.
It is not a de Polignac number, because 645650207013 - 21 = 645650207011 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (645650207011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 95478756 + ... + 95485517.
It is an arithmetic number, because the mean of its divisors is an integer number (43539854472).
Almost surely, 2645650207013 is an apocalyptic number.
It is an amenable number.
645650207013 is a deficient number, since it is larger than the sum of its proper divisors (399306300315).
645650207013 is a wasteful number, since it uses less digits than its factorization.
645650207013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190964313 (or 190964306 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 39.
The spelling of 645650207013 in words is "six hundred forty-five billion, six hundred fifty million, two hundred seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.280 sec. • engine limits •