Base | Representation |
---|---|
bin | 110101100110010011… |
… | …1110010010000110100 |
3 | 102000002122222002200020 |
4 | 1223030213302100310 |
5 | 3341212121200002 |
6 | 124513250045140 |
7 | 11213223654453 |
oct | 1531447622064 |
9 | 360078862606 |
10 | 115102131252 |
11 | 448a6174909 |
12 | 1a3835797b0 |
13 | ab14567394 |
14 | 57dca6cb9a |
15 | 2ed9ec52bc |
hex | 1acc9f2434 |
115102131252 has 96 divisors (see below), whose sum is σ = 292679116800. Its totient is φ = 35087116032.
The previous prime is 115102131229. The next prime is 115102131289. The reversal of 115102131252 is 252131201511.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 708699 + ... + 855837.
It is an arithmetic number, because the mean of its divisors is an integer number (3048740800).
Almost surely, 2115102131252 is an apocalyptic number.
115102131252 is a gapful number since it is divisible by the number (12) 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 115102131252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146339558400).
115102131252 is an abundant number, since it is smaller than the sum of its proper divisors (177576985548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115102131252 is a wasteful number, since it uses less digits than its factorization.
115102131252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147285 (or 147283 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 24.
Adding to 115102131252 its reverse (252131201511), we get a palindrome (367233332763).
The spelling of 115102131252 in words is "one hundred fifteen billion, one hundred two million, one hundred thirty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •