Base | Representation |
---|---|
bin | 110101101001110101… |
… | …1011011010011110011 |
3 | 102000101220202012011212 |
4 | 1223103223123103303 |
5 | 3341432423320243 |
6 | 124533115430335 |
7 | 11216162212550 |
oct | 1532353332363 |
9 | 360356665155 |
10 | 115220526323 |
11 | 44956a8a881 |
12 | 1a3b71553ab |
13 | ab32c4b936 |
14 | 581068ba27 |
15 | 2ee55b0318 |
hex | 1ad3adb4f3 |
115220526323 has 32 divisors (see below), whose sum is σ = 149420795904. Its totient is φ = 86506624512.
The previous prime is 115220526283. The next prime is 115220526347. The reversal of 115220526323 is 323625022511.
It is not a de Polignac number, because 115220526323 - 26 = 115220526259 is a prime.
It is a super-2 number, since 2×1152205263232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 115220526323.
It is not an unprimeable number, because it can be changed into a prime (115220526373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 467615 + ... + 670152.
It is an arithmetic number, because the mean of its divisors is an integer number (4669399872).
Almost surely, 2115220526323 is an apocalyptic number.
115220526323 is a deficient number, since it is larger than the sum of its proper divisors (34200269581).
115220526323 is a wasteful number, since it uses less digits than its factorization.
115220526323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1137851.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 115220526323 its reverse (323625022511), we get a palindrome (438845548834).
The spelling of 115220526323 in words is "one hundred fifteen billion, two hundred twenty million, five hundred twenty-six thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •