Base | Representation |
---|---|
bin | 110010100010001110… |
… | …1010111011001111010 |
3 | 101101010010122221110020 |
4 | 1211010131113121322 |
5 | 3234223304344010 |
6 | 121504334431310 |
7 | 10561202665062 |
oct | 1450435273172 |
9 | 341103587406 |
10 | 108522731130 |
11 | 4202a286150 |
12 | 19048062536 |
13 | a306436208 |
14 | 5376d1a3a2 |
15 | 2c5258d470 |
hex | 194475767a |
108522731130 has 32 divisors (see below), whose sum is σ = 284132242368. Its totient is φ = 26308540800.
The previous prime is 108522731069. The next prime is 108522731137. The reversal of 108522731130 is 31137225801.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 108522731091 and 108522731100.
It is not an unprimeable number, because it can be changed into a prime (108522731137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 164428051 + ... + 164428710.
It is an arithmetic number, because the mean of its divisors is an integer number (8879132574).
Almost surely, 2108522731130 is an apocalyptic number.
108522731130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
108522731130 is an abundant number, since it is smaller than the sum of its proper divisors (175609511238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108522731130 is a wasteful number, since it uses less digits than its factorization.
108522731130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328856782.
The product of its (nonzero) digits is 10080, while the sum is 33.
Adding to 108522731130 its reverse (31137225801), we get a palindrome (139659956931).
The spelling of 108522731130 in words is "one hundred eight billion, five hundred twenty-two million, seven hundred thirty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •