Base | Representation |
---|---|
bin | 10111111101010110000101… |
… | …000001100001101010110111 |
3 | 111211002100002202222022010222 |
4 | 113331112011001201222313 |
5 | 102302343110044130201 |
6 | 1012034340500404555 |
7 | 31123531202525024 |
oct | 2775260501415267 |
9 | 454070082868128 |
10 | 105370664442551 |
11 | 306354a2085582 |
12 | b99965a3a675b |
13 | 46a4546023111 |
14 | 1c03d7867254b |
15 | c2aded2ac91b |
hex | 5fd585061ab7 |
105370664442551 has 16 divisors (see below), whose sum is σ = 106879239754464. Its totient is φ = 103863865158144.
The previous prime is 105370664442529. The next prime is 105370664442583. The reversal of 105370664442551 is 155244466073501.
It is a cyclic number.
It is not a de Polignac number, because 105370664442551 - 26 = 105370664442487 is a prime.
It is a super-2 number, since 2×1053706644425512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105370664442493 and 105370664442502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105370664442151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1070062220 + ... + 1070160686.
It is an arithmetic number, because the mean of its divisors is an integer number (6679952484654).
Almost surely, 2105370664442551 is an apocalyptic number.
105370664442551 is a deficient number, since it is larger than the sum of its proper divisors (1508575311913).
105370664442551 is an equidigital number, since it uses as much as digits as its factorization.
105370664442551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107330.
The product of its (nonzero) digits is 12096000, while the sum is 53.
The spelling of 105370664442551 in words is "one hundred five trillion, three hundred seventy billion, six hundred sixty-four million, four hundred forty-two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •