Base | Representation |
---|---|
bin | 110001110010001000… |
… | …1100111111101000000 |
3 | 101012221200012221222200 |
4 | 1203210101213331000 |
5 | 3222422203243243 |
6 | 121040251433200 |
7 | 10503206564400 |
oct | 1434421477500 |
9 | 335850187880 |
10 | 106909040448 |
11 | 41381403491 |
12 | 18877755800 |
13 | a10a018a62 |
14 | 52628a0800 |
15 | 2baaa87ad3 |
hex | 18e4467f40 |
106909040448 has 126 divisors (see below), whose sum is σ = 356465834946. Its totient is φ = 30545432064.
The previous prime is 106909040437. The next prime is 106909040461. The reversal of 106909040448 is 844040909601.
It can be written as a sum of positive squares in only one way, i.e., 106881917184 + 27123264 = 326928^2 + 5208^2 .
It is a tau number, because it is divible by the number of its divisors (126).
It is a super-2 number, since 2×1069090404482 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 17 ways as a sum of consecutive naturals, for example, 1865715 + ... + 1922162.
Almost surely, 2106909040448 is an apocalyptic number.
106909040448 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
106909040448 is an abundant number, since it is smaller than the sum of its proper divisors (249556794498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106909040448 is a wasteful number, since it uses less digits than its factorization.
106909040448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3787909 (or 3787889 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 45.
The spelling of 106909040448 in words is "one hundred six billion, nine hundred nine million, forty thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •