Base | Representation |
---|---|
bin | 1101101100000000101… |
… | …0001110100100110000 |
3 | 211110222011020110002110 |
4 | 3123000022032210300 |
5 | 12323042421444332 |
6 | 300005530245320 |
7 | 22663201133625 |
oct | 3330012164460 |
9 | 743864213073 |
10 | 235152140592 |
11 | 90800286766 |
12 | 396a7b86840 |
13 | 19236c11175 |
14 | b54a8b234c |
15 | 61b45584cc |
hex | 36c028e930 |
235152140592 has 80 divisors (see below), whose sum is σ = 615801697280. Its totient is φ = 77316270336.
The previous prime is 235152140519. The next prime is 235152140611. The reversal of 235152140592 is 295041251532.
It is a super-2 number, since 2×2351521405922 (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 235152140592.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1065963 + ... + 1267509.
It is an arithmetic number, because the mean of its divisors is an integer number (7697521216).
Almost surely, 2235152140592 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 235152140592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (307900848640).
235152140592 is an abundant number, since it is smaller than the sum of its proper divisors (380649556688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
235152140592 is a wasteful number, since it uses less digits than its factorization.
235152140592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201890 (or 201884 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 39.
The spelling of 235152140592 in words is "two hundred thirty-five billion, one hundred fifty-two million, one hundred forty thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •