Base | Representation |
---|---|
bin | 110011001000000001… |
… | …0100011010001001010 |
3 | 101111101111201000010002 |
4 | 1212100002203101022 |
5 | 3244322414122000 |
6 | 122234233123002 |
7 | 10634501102120 |
oct | 1462002432112 |
9 | 344344630102 |
10 | 109790770250 |
11 | 42620033767 |
12 | 19340859462 |
13 | a479060815 |
14 | 54574bb910 |
15 | 2cc8a688d5 |
hex | 19900a344a |
109790770250 has 128 divisors (see below), whose sum is σ = 253011492864. Its totient is φ = 34844040000.
The previous prime is 109790770247. The next prime is 109790770259. The reversal of 109790770250 is 52077097901.
It is a super-3 number, since 3×1097907702503 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 109790770195 and 109790770204.
It is not an unprimeable number, because it can be changed into a prime (109790770259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1203755 + ... + 1291745.
It is an arithmetic number, because the mean of its divisors is an integer number (1976652288).
Almost surely, 2109790770250 is an apocalyptic number.
109790770250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
109790770250 is an abundant number, since it is smaller than the sum of its proper divisors (143220722614).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109790770250 is a wasteful number, since it uses less digits than its factorization.
109790770250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88069 (or 88059 counting only the distinct ones).
The product of its (nonzero) digits is 277830, while the sum is 47.
The spelling of 109790770250 in words is "one hundred nine billion, seven hundred ninety million, seven hundred seventy thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •