Base | Representation |
---|---|
bin | 110001001100000010… |
… | …0110010000111100101 |
3 | 101002122120121202100011 |
4 | 1202120010302013211 |
5 | 3212312413341142 |
6 | 120305342250221 |
7 | 10426424222563 |
oct | 1423004620745 |
9 | 332576552304 |
10 | 105630605797 |
11 | 408857a5622 |
12 | 1857b586971 |
13 | 9c651c1852 |
14 | 5180b94a33 |
15 | 2b33707417 |
hex | 18981321e5 |
105630605797 has 4 divisors (see below), whose sum is σ = 105668455456. Its totient is φ = 105592756140.
The previous prime is 105630605737. The next prime is 105630605813. The reversal of 105630605797 is 797506036501.
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 105630605797 - 219 = 105630081509 is a prime.
It is a super-2 number, since 2×1056306057972 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105630605797.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105630605737) 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, 18920643 + ... + 18926224.
It is an arithmetic number, because the mean of its divisors is an integer number (26417113864).
Almost surely, 2105630605797 is an apocalyptic number.
It is an amenable number.
105630605797 is a deficient number, since it is larger than the sum of its proper divisors (37849659).
105630605797 is an equidigital number, since it uses as much as digits as its factorization.
105630605797 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37849658.
The product of its (nonzero) digits is 1190700, while the sum is 49.
The spelling of 105630605797 in words is "one hundred five billion, six hundred thirty million, six hundred five thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •