Base | Representation |
---|---|
bin | 110001001100011111… |
… | …0000101111000101001 |
3 | 101002200121220000020221 |
4 | 1202120332011320221 |
5 | 3212330240111334 |
6 | 120311040250041 |
7 | 10426666013116 |
oct | 1423076057051 |
9 | 332617800227 |
10 | 105645628969 |
11 | 40893226771 |
12 | 18584610921 |
13 | 9c683518ba |
14 | 5182b8590d |
15 | 2b34bc38b4 |
hex | 1898f85e29 |
105645628969 has 4 divisors (see below), whose sum is σ = 105658566480. Its totient is φ = 105632691460.
The previous prime is 105645628961. The next prime is 105645628987. The reversal of 105645628969 is 969826546501.
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 105645628969 - 23 = 105645628961 is a prime.
It is a super-2 number, since 2×1056456289692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105645628961) 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, 6456499 + ... + 6472840.
It is an arithmetic number, because the mean of its divisors is an integer number (26414641620).
Almost surely, 2105645628969 is an apocalyptic number.
It is an amenable number.
105645628969 is a deficient number, since it is larger than the sum of its proper divisors (12937511).
105645628969 is an equidigital number, since it uses as much as digits as its factorization.
105645628969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12937510.
The product of its (nonzero) digits is 27993600, while the sum is 61.
It can be divided in two parts, 1056 and 45628969, that added together give a square (45630025 = 67552).
The spelling of 105645628969 in words is "one hundred five billion, six hundred forty-five million, six hundred twenty-eight thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •