Base | Representation |
---|---|
bin | 110100110011000000111101… |
… | …111001111001111001100101 |
3 | 1010110011111111111022121101110 |
4 | 310303000331321321321211 |
5 | 220413413100010333420 |
6 | 2141505040351015233 |
7 | 66624124212663231 |
oct | 6463007571717145 |
9 | 1113144444277343 |
10 | 232204150480485 |
11 | 67a9525543a847 |
12 | 2206287820a519 |
13 | 9c749b010c871 |
14 | 414aa52c675c1 |
15 | 1bca269866ee0 |
hex | d3303de79e65 |
232204150480485 has 8 divisors (see below), whose sum is σ = 371526640768800. Its totient is φ = 123842213589584.
The previous prime is 232204150480483. The next prime is 232204150480507. The reversal of 232204150480485 is 584084051402232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 232204150480485 - 21 = 232204150480483 is a prime.
It is a super-3 number, since 3×2322041504804853 (a number of 44 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232204150480483) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7740138349335 + ... + 7740138349364.
It is an arithmetic number, because the mean of its divisors is an integer number (46440830096100).
Almost surely, 2232204150480485 is an apocalyptic number.
It is an amenable number.
232204150480485 is a deficient number, since it is larger than the sum of its proper divisors (139322490288315).
232204150480485 is a wasteful number, since it uses less digits than its factorization.
232204150480485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15480276698707.
The product of its (nonzero) digits is 2457600, while the sum is 48.
The spelling of 232204150480485 in words is "two hundred thirty-two trillion, two hundred four billion, one hundred fifty million, four hundred eighty thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •