Base | Representation |
---|---|
bin | 110010100001011100… |
… | …1001001110111000100 |
3 | 101101001022020021221210 |
4 | 1211002321021313010 |
5 | 3234200043230002 |
6 | 121501555411420 |
7 | 10560433463364 |
oct | 1450271116704 |
9 | 341038207853 |
10 | 108496461252 |
11 | 42016473203 |
12 | 1903b2b3b70 |
13 | a300b68cca |
14 | 537363c9a4 |
15 | 2c500ee96c |
hex | 1942e49dc4 |
108496461252 has 48 divisors (see below), whose sum is σ = 254846390400. Its totient is φ = 35924942592.
The previous prime is 108496461251. The next prime is 108496461253. The reversal of 108496461252 is 252164694801.
It is an interprime number because it is at equal distance from previous prime (108496461251) and next prime (108496461253).
It is not an unprimeable number, because it can be changed into a prime (108496461251) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1436578 + ... + 1510214.
It is an arithmetic number, because the mean of its divisors is an integer number (5309299800).
Almost surely, 2108496461252 is an apocalyptic number.
108496461252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
108496461252 is an abundant number, since it is smaller than the sum of its proper divisors (146349929148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108496461252 is a wasteful number, since it uses less digits than its factorization.
108496461252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74460 (or 74458 counting only the distinct ones).
The product of its (nonzero) digits is 829440, while the sum is 48.
The spelling of 108496461252 in words is "one hundred eight billion, four hundred ninety-six million, four hundred sixty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •