Base | Representation |
---|---|
bin | 110001001100101010… |
… | …0101110001001011010 |
3 | 101002201001001101112122 |
4 | 1202121110232021122 |
5 | 3212333244423200 |
6 | 120311411341242 |
7 | 10430100310610 |
oct | 1423124561132 |
9 | 332631041478 |
10 | 105651561050 |
11 | 40896608612 |
12 | 185865b1822 |
13 | 9c6964a9c9 |
14 | 518388b6b0 |
15 | 2b35496385 |
hex | 189952e25a |
105651561050 has 24 divisors (see below), whose sum is σ = 224585033376. Its totient is φ = 36223392240.
The previous prime is 105651561049. The next prime is 105651561061. The reversal of 105651561050 is 50165156501.
It is a super-2 number, since 2×1056515610502 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 105651561050.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 150930452 + ... + 150931151.
It is an arithmetic number, because the mean of its divisors is an integer number (9357709724).
Almost surely, 2105651561050 is an apocalyptic number.
105651561050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105651561050 is an abundant number, since it is smaller than the sum of its proper divisors (118933472326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105651561050 is a wasteful number, since it uses less digits than its factorization.
105651561050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301861622 (or 301861617 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 35.
The spelling of 105651561050 in words is "one hundred five billion, six hundred fifty-one million, five hundred sixty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •