Base | Representation |
---|---|
bin | 110011001011001101… |
… | …0101001011011110000 |
3 | 101111122222000011002112 |
4 | 1212112122221123300 |
5 | 3300032311002011 |
6 | 122253014104452 |
7 | 10640240315150 |
oct | 1462632513360 |
9 | 344588004075 |
10 | 109897750256 |
11 | 42675462398 |
12 | 1937064b128 |
13 | a4952793b8 |
14 | 54677a8760 |
15 | 2cd314b58b |
hex | 19966a96f0 |
109897750256 has 40 divisors (see below), whose sum is σ = 243543325920. Its totient is φ = 47060653824.
The previous prime is 109897750241. The next prime is 109897750307. The reversal of 109897750256 is 652057798901.
It is a super-2 number, since 2×1098977502562 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 109897750195 and 109897750204.
It is a congruent number.
It is an unprimeable number.
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, 261551 + ... + 536846.
It is an arithmetic number, because the mean of its divisors is an integer number (6088583148).
Almost surely, 2109897750256 is an apocalyptic number.
109897750256 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
109897750256 is an abundant number, since it is smaller than the sum of its proper divisors (133645575664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109897750256 is a wasteful number, since it uses less digits than its factorization.
109897750256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 799641 (or 799635 counting only the distinct ones).
The product of its (nonzero) digits is 9525600, while the sum is 59.
The spelling of 109897750256 in words is "one hundred nine billion, eight hundred ninety-seven million, seven hundred fifty thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •