Base | Representation |
---|---|
bin | 1000100000110000011… |
… | …0111111000000010100 |
3 | 111222110011101121010110 |
4 | 2020030012333000110 |
5 | 4343440400424323 |
6 | 151102244123020 |
7 | 13364523610266 |
oct | 2101406770024 |
9 | 458404347113 |
10 | 146232045588 |
11 | 570201a5242 |
12 | 24410996470 |
13 | 10a35a55135 |
14 | 71131a1b36 |
15 | 3c0cde3793 |
hex | 220c1bf014 |
146232045588 has 96 divisors (see below), whose sum is σ = 363475728000. Its totient is φ = 45625282560.
The previous prime is 146232045581. The next prime is 146232045601. The reversal of 146232045588 is 885540232641.
It is a super-2 number, since 2×1462320455882 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146232045581) 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, 46852668 + ... + 46855788.
It is an arithmetic number, because the mean of its divisors is an integer number (3786205500).
Almost surely, 2146232045588 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 146232045588, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181737864000).
146232045588 is an abundant number, since it is smaller than the sum of its proper divisors (217243682412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146232045588 is a wasteful number, since it uses less digits than its factorization.
146232045588 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5545 (or 5543 counting only the distinct ones).
The product of its (nonzero) digits is 1843200, while the sum is 48.
The spelling of 146232045588 in words is "one hundred forty-six billion, two hundred thirty-two million, forty-five thousand, five hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •