Base | Representation |
---|---|
bin | 110101101010110001… |
… | …1100101010001110001 |
3 | 102000111010000110110112 |
4 | 1223111203211101301 |
5 | 3342014004240213 |
6 | 124540202511105 |
7 | 11220024021020 |
oct | 1532543452161 |
9 | 360433013415 |
10 | 115252024433 |
11 | 44972843877 |
12 | 1a405805495 |
13 | ab39629780 |
14 | 581492a8b7 |
15 | 2ee8232ea8 |
hex | 1ad58e5471 |
115252024433 has 32 divisors (see below), whose sum is σ = 150747448320. Its totient is φ = 85507384320.
The previous prime is 115252024427. The next prime is 115252024441. The reversal of 115252024433 is 334420252511.
It is a cyclic number.
It is not a de Polignac number, because 115252024433 - 26 = 115252024369 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 115252024433.
It is not an unprimeable number, because it can be changed into a prime (115252024403) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 281783 + ... + 556691.
It is an arithmetic number, because the mean of its divisors is an integer number (4710857760).
Almost surely, 2115252024433 is an apocalyptic number.
115252024433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
115252024433 is a deficient number, since it is larger than the sum of its proper divisors (35495423887).
115252024433 is a wasteful number, since it uses less digits than its factorization.
115252024433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275217.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 115252024433 its reverse (334420252511), we get a palindrome (449672276944).
The spelling of 115252024433 in words is "one hundred fifteen billion, two hundred fifty-two million, twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •