Base | Representation |
---|---|
bin | 11001000000100000000111… |
… | …100011010110011010000110 |
3 | 112102102112012000000210101000 |
4 | 121000200013203112122012 |
5 | 103404001102200121202 |
6 | 1025530413144514130 |
7 | 32111125630110456 |
oct | 3100400743263206 |
9 | 472375160023330 |
10 | 109985649223302 |
11 | 32054719737266 |
12 | 10403b5747b946 |
13 | 494a7aa0c6a08 |
14 | 1d23496037d66 |
15 | caaea48e091c |
hex | 6408078d6686 |
109985649223302 has 64 divisors (see below), whose sum is σ = 244534104864000. Its totient is φ = 36643654442304.
The previous prime is 109985649223279. The next prime is 109985649223309. The reversal of 109985649223302 is 203322946589901.
109985649223302 is a `hidden beast` number, since 1 + 0 + 9 + 98 + 5 + 6 + 492 + 23 + 30 + 2 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 109985649223302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109985649223309) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1078038849 + ... + 1078140867.
It is an arithmetic number, because the mean of its divisors is an integer number (3820845388500).
Almost surely, 2109985649223302 is an apocalyptic number.
109985649223302 is an abundant number, since it is smaller than the sum of its proper divisors (134548455640698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109985649223302 is a wasteful number, since it uses less digits than its factorization.
109985649223302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111762 (or 111756 counting only the distinct ones).
The product of its (nonzero) digits is 50388480, while the sum is 63.
The spelling of 109985649223302 in words is "one hundred nine trillion, nine hundred eighty-five billion, six hundred forty-nine million, two hundred twenty-three thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •