Base | Representation |
---|---|
bin | 110001000010110101… |
… | …0010110110011111001 |
3 | 101001212001100010012212 |
4 | 1202011222112303321 |
5 | 3211144323011223 |
6 | 120214545144505 |
7 | 10415653402532 |
oct | 1420552266371 |
9 | 331761303185 |
10 | 105321688313 |
11 | 40737390316 |
12 | 184b402b135 |
13 | 9c161c0b3a |
14 | 5151b3d689 |
15 | 2b16536278 |
hex | 1885a96cf9 |
105321688313 has 4 divisors (see below), whose sum is σ = 105336700560. Its totient is φ = 105306676068.
The previous prime is 105321688279. The next prime is 105321688337. The reversal of 105321688313 is 313886123501.
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 105321688313 - 230 = 104247946489 is a prime.
It is a super-2 number, since 2×1053216883132 (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 (105321688613) 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 3 ways as a sum of consecutive naturals, for example, 7495595 + ... + 7509632.
It is an arithmetic number, because the mean of its divisors is an integer number (26334175140).
Almost surely, 2105321688313 is an apocalyptic number.
It is an amenable number.
105321688313 is a deficient number, since it is larger than the sum of its proper divisors (15012247).
105321688313 is an equidigital number, since it uses as much as digits as its factorization.
105321688313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15012246.
The product of its (nonzero) digits is 103680, while the sum is 41.
The spelling of 105321688313 in words is "one hundred five billion, three hundred twenty-one million, six hundred eighty-eight thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •