Base | Representation |
---|---|
bin | 110010110111001011… |
… | …0111110010000101000 |
3 | 101102221010102101011222 |
4 | 1211232112332100220 |
5 | 3242143234321334 |
6 | 122102205441212 |
7 | 10614500055140 |
oct | 1455626762050 |
9 | 342833371158 |
10 | 109225698344 |
11 | 42360071894 |
12 | 19203570208 |
13 | a3b8c74049 |
14 | 5402427920 |
15 | 2c94149d2e |
hex | 196e5be428 |
109225698344 has 128 divisors (see below), whose sum is σ = 243720192000. Its totient is φ = 44906400000.
The previous prime is 109225698311. The next prime is 109225698371. The reversal of 109225698344 is 443896522901.
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 31 ways as a sum of consecutive naturals, for example, 145439969 + ... + 145440719.
It is an arithmetic number, because the mean of its divisors is an integer number (1904064000).
Almost surely, 2109225698344 is an apocalyptic number.
109225698344 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 109225698344, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121860096000).
109225698344 is an abundant number, since it is smaller than the sum of its proper divisors (134494493656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109225698344 is a wasteful number, since it uses less digits than its factorization.
109225698344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1415 (or 1411 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 53.
The spelling of 109225698344 in words is "one hundred nine billion, two hundred twenty-five million, six hundred ninety-eight thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •