Base | Representation |
---|---|
bin | 100000101111011111000… |
… | …111011001101100011111 |
3 | 21222002200010221110012001 |
4 | 200233133013121230133 |
5 | 243331010323431411 |
6 | 4441350231423131 |
7 | 321362242155250 |
oct | 40573707315437 |
9 | 7862603843161 |
10 | 2250011155231 |
11 | 798251704134 |
12 | 304098224aa7 |
13 | 134237a2a898 |
14 | 7ac88966b27 |
15 | 3d7dbc9bdc1 |
hex | 20bdf1d9b1f |
2250011155231 has 32 divisors (see below), whose sum is σ = 2745318251520. Its totient is φ = 1801071417600.
The previous prime is 2250011155157. The next prime is 2250011155261. The reversal of 2250011155231 is 1325511100522.
It is a happy number.
It is not a de Polignac number, because 2250011155231 - 29 = 2250011154719 is a prime.
It is a super-2 number, since 2×22500111552312 (a number of 26 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 2250011155231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2250011155261) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 82716525 + ... + 82743721.
It is an arithmetic number, because the mean of its divisors is an integer number (85791195360).
Almost surely, 22250011155231 is an apocalyptic number.
2250011155231 is a deficient number, since it is larger than the sum of its proper divisors (495307096289).
2250011155231 is a wasteful number, since it uses less digits than its factorization.
2250011155231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36055.
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 2250011155231 its reverse (1325511100522), we get a palindrome (3575522255753).
The spelling of 2250011155231 in words is "two trillion, two hundred fifty billion, eleven million, one hundred fifty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •