Base | Representation |
---|---|
bin | 110001000011001010… |
… | …0111110100001111011 |
3 | 101001212211100202022222 |
4 | 1202012110332201323 |
5 | 3211210203023201 |
6 | 120220024434255 |
7 | 10416150355235 |
oct | 1420624764173 |
9 | 331784322288 |
10 | 105332861051 |
11 | 40742721590 |
12 | 184b791898b |
13 | 9c18603422 |
14 | 515340b255 |
15 | 2b174e191b |
hex | 188653e87b |
105332861051 has 8 divisors (see below), whose sum is σ = 115640479344. Its totient is φ = 95147226720.
The previous prime is 105332861047. The next prime is 105332861057. The reversal of 105332861051 is 150168233501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105332861051 - 22 = 105332861047 is a prime.
It is a super-2 number, since 2×1053328610512 (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 (105332861057) 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 7 ways as a sum of consecutive naturals, for example, 30494180 + ... + 30497633.
It is an arithmetic number, because the mean of its divisors is an integer number (14455059918).
Almost surely, 2105332861051 is an apocalyptic number.
105332861051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
105332861051 is a deficient number, since it is larger than the sum of its proper divisors (10307618293).
105332861051 is a wasteful number, since it uses less digits than its factorization.
105332861051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60991981.
The product of its (nonzero) digits is 21600, while the sum is 35.
The spelling of 105332861051 in words is "one hundred five billion, three hundred thirty-two million, eight hundred sixty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •