Base | Representation |
---|---|
bin | 1001010011111000100110… |
… | …0011001010110000100001 |
3 | 1100020200001002122211101210 |
4 | 2110332021203022300201 |
5 | 2320211303434422230 |
6 | 33434524520420333 |
7 | 2104420503514602 |
oct | 224761143126041 |
9 | 40220032584353 |
10 | 10237214764065 |
11 | 329763a93a283 |
12 | 119405a6176a9 |
13 | 59349949bb43 |
14 | 2756ab91bda9 |
15 | 12b4605cdeb0 |
hex | 94f898cac21 |
10237214764065 has 64 divisors (see below), whose sum is σ = 16800225361920. Its totient is φ = 5320233757440.
The previous prime is 10237214764031. The next prime is 10237214764067. The reversal of 10237214764065 is 56046741273201.
It is not a de Polignac number, because 10237214764065 - 211 = 10237214762017 is a prime.
It is a super-2 number, since 2×102372147640652 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10237214764067) 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 63 ways as a sum of consecutive naturals, for example, 781281304 + ... + 781294406.
It is an arithmetic number, because the mean of its divisors is an integer number (262503521280).
Almost surely, 210237214764065 is an apocalyptic number.
10237214764065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10237214764065 is a deficient number, since it is larger than the sum of its proper divisors (6563010597855).
10237214764065 is a wasteful number, since it uses less digits than its factorization.
10237214764065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15934.
The product of its (nonzero) digits is 1693440, while the sum is 48.
The spelling of 10237214764065 in words is "ten trillion, two hundred thirty-seven billion, two hundred fourteen million, seven hundred sixty-four thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •