Base | Representation |
---|---|
bin | 11010001100110101011100… |
… | …100110011000100011111110 |
3 | 120002222222221121212102011022 |
4 | 122030311130212120203332 |
5 | 110100422030133302314 |
6 | 1045024255150224142 |
7 | 33162116220602315 |
oct | 3214653446304376 |
9 | 502888847772138 |
10 | 115231231150334 |
11 | 33797321a043a2 |
12 | 10b107021b5052 |
13 | 4c3b348b298b0 |
14 | 206531553127c |
15 | d4c66712278e |
hex | 68cd5c9988fe |
115231231150334 has 32 divisors (see below), whose sum is σ = 188694557039520. Its totient is φ = 52454574369792.
The previous prime is 115231231150331. The next prime is 115231231150363. The reversal of 115231231150334 is 433051132132511.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 115231231150294 and 115231231150303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115231231150331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 236967254 + ... + 237453030.
It is an arithmetic number, because the mean of its divisors is an integer number (5896704907485).
Almost surely, 2115231231150334 is an apocalyptic number.
115231231150334 is a deficient number, since it is larger than the sum of its proper divisors (73463325889186).
115231231150334 is a wasteful number, since it uses less digits than its factorization.
115231231150334 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 610844.
The product of its (nonzero) digits is 32400, while the sum is 35.
Adding to 115231231150334 its reverse (433051132132511), we get a palindrome (548282363282845).
The spelling of 115231231150334 in words is "one hundred fifteen trillion, two hundred thirty-one billion, two hundred thirty-one million, one hundred fifty thousand, three hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •