Base | Representation |
---|---|
bin | 110101101010001001… |
… | …1110110100010110001 |
3 | 102000102122200120221211 |
4 | 1223110103312202301 |
5 | 3341443131424013 |
6 | 124534134520121 |
7 | 11216351250523 |
oct | 1532423664261 |
9 | 360378616854 |
10 | 115231123633 |
11 | 44961a6878a |
12 | 1a3ba806041 |
13 | ab351bc332 |
14 | 5811c49a13 |
15 | 2ee64a523d |
hex | 1ad44f68b1 |
115231123633 has 2 divisors, whose sum is σ = 115231123634. Its totient is φ = 115231123632.
The previous prime is 115231123627. The next prime is 115231123643. The reversal of 115231123633 is 336321132511.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88365291169 + 26865832464 = 297263^2 + 163908^2 .
It is a cyclic number.
It is not a de Polignac number, because 115231123633 - 229 = 114694252721 is a prime.
It is a super-2 number, since 2×1152311236332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115231123595 and 115231123604.
It is not a weakly prime, because it can be changed into another prime (115231123643) 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 as a sum of consecutive naturals, namely, 57615561816 + 57615561817.
It is an arithmetic number, because the mean of its divisors is an integer number (57615561817).
Almost surely, 2115231123633 is an apocalyptic number.
It is an amenable number.
115231123633 is a deficient number, since it is larger than the sum of its proper divisors (1).
115231123633 is an equidigital number, since it uses as much as digits as its factorization.
115231123633 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9720, while the sum is 31.
The spelling of 115231123633 in words is "one hundred fifteen billion, two hundred thirty-one million, one hundred twenty-three thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •