Base | Representation |
---|---|
bin | 11000000010101011010111… |
… | …100000111110110000000001 |
3 | 111212101100222201221221120101 |
4 | 120002223113200332300001 |
5 | 102324344110340440001 |
6 | 1012514543532442401 |
7 | 31162153264024234 |
oct | 3002532740766001 |
9 | 455340881857511 |
10 | 105737120640001 |
11 | 30766952049604 |
12 | ba3868b919401 |
13 | 46ccc77034486 |
14 | 1c179bd8a941b |
15 | c356e9dbba01 |
hex | 602ad783ec01 |
105737120640001 has 4 divisors (see below), whose sum is σ = 105737885421232. Its totient is φ = 105736355858772.
The previous prime is 105737120639971. The next prime is 105737120640043. The reversal of 105737120640001 is 100046021737501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 105737120640001 - 29 = 105737120639489 is a prime.
It is a super-2 number, since 2×1057371206400012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105737120640061) 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, 382183191 + ... + 382459756.
It is an arithmetic number, because the mean of its divisors is an integer number (26434471355308).
Almost surely, 2105737120640001 is an apocalyptic number.
It is an amenable number.
105737120640001 is a deficient number, since it is larger than the sum of its proper divisors (764781231).
105737120640001 is an equidigital number, since it uses as much as digits as its factorization.
105737120640001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 764781230.
The product of its (nonzero) digits is 35280, while the sum is 37.
The spelling of 105737120640001 in words is "one hundred five trillion, seven hundred thirty-seven billion, one hundred twenty million, six hundred forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •