Base | Representation |
---|---|
bin | 110010101110110111… |
… | …1101110010110001010 |
3 | 101102012200221201101110 |
4 | 1211131233232112022 |
5 | 3241110411132330 |
6 | 122014411431150 |
7 | 10604544000033 |
oct | 1453557562612 |
9 | 342180851343 |
10 | 108946974090 |
11 | 422277aa169 |
12 | 191461554b6 |
13 | a3732b5256 |
14 | 53b73d1a8a |
15 | 2c7993edb0 |
hex | 195dbee58a |
108946974090 has 64 divisors (see below), whose sum is σ = 271054771200. Its totient is φ = 27992047104.
The previous prime is 108946974079. The next prime is 108946974091. The reversal of 108946974090 is 90479649801.
It is a self number, because there is not a number n which added to its sum of digits gives 108946974090.
It is not an unprimeable number, because it can be changed into a prime (108946974091) 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, 286014 + ... + 547446.
It is an arithmetic number, because the mean of its divisors is an integer number (4235230800).
Almost surely, 2108946974090 is an apocalyptic number.
108946974090 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 108946974090, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135527385600).
108946974090 is an abundant number, since it is smaller than the sum of its proper divisors (162107797110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108946974090 is a wasteful number, since it uses less digits than its factorization.
108946974090 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 261951.
The product of its (nonzero) digits is 3919104, while the sum is 57.
The spelling of 108946974090 in words is "one hundred eight billion, nine hundred forty-six million, nine hundred seventy-four thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •