Base | Representation |
---|---|
bin | 110101100100110110… |
… | …1100001110101000000 |
3 | 101222222021002110212011 |
4 | 1223021231201311000 |
5 | 3341112121231102 |
6 | 124504343342304 |
7 | 11212061646352 |
oct | 1531155416500 |
9 | 358867073764 |
10 | 115053305152 |
11 | 44880656065 |
12 | 1a36b151994 |
13 | ab074003b6 |
14 | 57d639d0d2 |
15 | 2ed5a7d2d7 |
hex | 1ac9b61d40 |
115053305152 has 28 divisors (see below), whose sum is σ = 228329497620. Its totient is φ = 57521463296.
The previous prime is 115053305131. The next prime is 115053305153. The reversal of 115053305152 is 251503350511.
It can be written as a sum of positive squares in 2 ways, for example, as 31263897856 + 83789407296 = 176816^2 + 289464^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115053305153) 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 3 ways as a sum of consecutive naturals, for example, 690918 + ... + 841114.
It is an arithmetic number, because the mean of its divisors is an integer number (8154624915).
Almost surely, 2115053305152 is an apocalyptic number.
It is an amenable number.
115053305152 is a deficient number, since it is larger than the sum of its proper divisors (113276192468).
115053305152 is a wasteful number, since it uses less digits than its factorization.
115053305152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162178 (or 162168 counting only the distinct ones).
The product of its (nonzero) digits is 11250, while the sum is 31.
Adding to 115053305152 its reverse (251503350511), we get a palindrome (366556655663).
The spelling of 115053305152 in words is "one hundred fifteen billion, fifty-three million, three hundred five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •