Base | Representation |
---|---|
bin | 1101101011100011110… |
… | …0010011111101100011 |
3 | 211110122201101111221122 |
4 | 3122320330103331203 |
5 | 12322320422132011 |
6 | 255545523042455 |
7 | 22660200660221 |
oct | 3327074237543 |
9 | 743581344848 |
10 | 235031052131 |
11 | 907489a1157 |
12 | 3967351042b |
13 | 19217ac59a5 |
14 | b538791b11 |
15 | 61a8ada3db |
hex | 36b8f13f63 |
235031052131 has 16 divisors (see below), whose sum is σ = 253742112000. Its totient is φ = 217029851808.
The previous prime is 235031052127. The next prime is 235031052211. The reversal of 235031052131 is 131250130532.
It is a cyclic number.
It is not a de Polignac number, because 235031052131 - 22 = 235031052127 is a prime.
It is a super-2 number, since 2×2350310521312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 235031052131.
It is not an unprimeable number, because it can be changed into a prime (235031054131) 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 15 ways as a sum of consecutive naturals, for example, 5781980 + ... + 5822486.
It is an arithmetic number, because the mean of its divisors is an integer number (15858882000).
Almost surely, 2235031052131 is an apocalyptic number.
235031052131 is a deficient number, since it is larger than the sum of its proper divisors (18711059869).
235031052131 is a wasteful number, since it uses less digits than its factorization.
235031052131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49258.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 235031052131 its reverse (131250130532), we get a palindrome (366281182663).
The spelling of 235031052131 in words is "two hundred thirty-five billion, thirty-one million, fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •