Base | Representation |
---|---|
bin | 110000111111111101… |
… | …1011110000011101001 |
3 | 101001121100100210221112 |
4 | 1201333323132003221 |
5 | 3211000212324040 |
6 | 120201231520105 |
7 | 10413405041606 |
oct | 1417773360351 |
9 | 331540323845 |
10 | 105225511145 |
11 | 4069806aa57 |
12 | 18487989035 |
13 | 9bcc2b8381 |
14 | 51430656ad |
15 | 2b0cd89365 |
hex | 187fede0e9 |
105225511145 has 8 divisors (see below), whose sum is σ = 126676630080. Its totient is φ = 83909731120.
The previous prime is 105225511141. The next prime is 105225511151. The reversal of 105225511145 is 541115522501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105225511145 - 22 = 105225511141 is a prime.
It is a super-2 number, since 2×1052255111452 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105225511141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33833015 + ... + 33836124.
It is an arithmetic number, because the mean of its divisors is an integer number (15834578760).
Almost surely, 2105225511145 is an apocalyptic number.
It is an amenable number.
105225511145 is a deficient number, since it is larger than the sum of its proper divisors (21451118935).
105225511145 is an equidigital number, since it uses as much as digits as its factorization.
105225511145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67669455.
The product of its (nonzero) digits is 10000, while the sum is 32.
The spelling of 105225511145 in words is "one hundred five billion, two hundred twenty-five million, five hundred eleven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •