Base | Representation |
---|---|
bin | 110101100110011111… |
… | …0101101100001100000 |
3 | 102000010002021102201010 |
4 | 1223030332231201200 |
5 | 3341220141004102 |
6 | 124514022540520 |
7 | 11213326025154 |
oct | 1531476554140 |
9 | 360102242633 |
10 | 115108141152 |
11 | 448a95aa174 |
12 | 1a385597740 |
13 | ab1588ca34 |
14 | 57dd795064 |
15 | 2eda7b0d6c |
hex | 1accfad860 |
115108141152 has 24 divisors (see below), whose sum is σ = 302158870776. Its totient is φ = 38369380352.
The previous prime is 115108141103. The next prime is 115108141171. The reversal of 115108141152 is 251141801511.
It is a tau number, because it is divible by the number of its divisors (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 599521473 + ... + 599521664.
It is an arithmetic number, because the mean of its divisors is an integer number (12589952949).
Almost surely, 2115108141152 is an apocalyptic number.
115108141152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
115108141152 is an abundant number, since it is smaller than the sum of its proper divisors (187050729624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115108141152 is a wasteful number, since it uses less digits than its factorization.
115108141152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1199043150 (or 1199043142 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 30.
Adding to 115108141152 its reverse (251141801511), we get a palindrome (366249942663).
The spelling of 115108141152 in words is "one hundred fifteen billion, one hundred eight million, one hundred forty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •