Base | Representation |
---|---|
bin | 110001010111010111… |
… | …0001100100010001010 |
3 | 101010122001120110102010 |
4 | 1202232232030202022 |
5 | 3214102200420100 |
6 | 120411154120350 |
7 | 10442016616641 |
oct | 1425656144212 |
9 | 333561513363 |
10 | 106010560650 |
11 | 40a6021a2a5 |
12 | 186668800b6 |
13 | 9cc5b352c7 |
14 | 51b941c358 |
15 | 2b56c5b750 |
hex | 18aeb8c88a |
106010560650 has 48 divisors (see below), whose sum is σ = 263022701184. Its totient is φ = 28256954880.
The previous prime is 106010560637. The next prime is 106010560679. The reversal of 106010560650 is 56065010601.
It is a super-2 number, since 2×1060105606502 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 23 ways as a sum of consecutive naturals, for example, 185487 + ... + 496413.
It is an arithmetic number, because the mean of its divisors is an integer number (5479639608).
Almost surely, 2106010560650 is an apocalyptic number.
106010560650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106010560650 is an abundant number, since it is smaller than the sum of its proper divisors (157012140534).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106010560650 is a wasteful number, since it uses less digits than its factorization.
106010560650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313215 (or 313210 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 30.
The spelling of 106010560650 in words is "one hundred six billion, ten million, five hundred sixty thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •