Base | Representation |
---|---|
bin | 110001000100001101… |
… | …1111001001010101001 |
3 | 101001222021220121101021 |
4 | 1202020123321022221 |
5 | 3211243231303041 |
6 | 120223330452441 |
7 | 10420060110343 |
oct | 1421033711251 |
9 | 331867817337 |
10 | 105368228521 |
11 | 407606886a6 |
12 | 18507734121 |
13 | 9c22a3751a |
14 | 5157db6293 |
15 | 2b1a67acd1 |
hex | 18886f92a9 |
105368228521 has 4 divisors (see below), whose sum is σ = 109949455872. Its totient is φ = 100787001172.
The previous prime is 105368228437. The next prime is 105368228527. The reversal of 105368228521 is 125822863501.
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 105368228521 - 215 = 105368195753 is a prime.
It is a super-2 number, since 2×1053682285212 (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 (105368228527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2290613641 + ... + 2290613686.
It is an arithmetic number, because the mean of its divisors is an integer number (27487363968).
Almost surely, 2105368228521 is an apocalyptic number.
It is an amenable number.
105368228521 is a deficient number, since it is larger than the sum of its proper divisors (4581227351).
105368228521 is an equidigital number, since it uses as much as digits as its factorization.
105368228521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4581227350.
The product of its (nonzero) digits is 230400, while the sum is 43.
The spelling of 105368228521 in words is "one hundred five billion, three hundred sixty-eight million, two hundred twenty-eight thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •