Base | Representation |
---|---|
bin | 1101100000110010101… |
… | …1110110010111010001 |
3 | 211012012022100110210012 |
4 | 3120030223312113101 |
5 | 12300411102233231 |
6 | 254351044244305 |
7 | 22525446262001 |
oct | 3301453662721 |
9 | 735168313705 |
10 | 232141055441 |
11 | 8a4a5634939 |
12 | 38ba76a0695 |
13 | 18b77148189 |
14 | b342a22001 |
15 | 608a024e2b |
hex | 360caf65d1 |
232141055441 has 8 divisors (see below), whose sum is σ = 242516160960. Its totient is φ = 221789451312.
The previous prime is 232141055407. The next prime is 232141055459. The reversal of 232141055441 is 144550141232.
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 232141055441 - 222 = 232136861137 is a prime.
It is a super-2 number, since 2×2321410554412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232141055398 and 232141055407.
It is not an unprimeable number, because it can be changed into a prime (232141015441) 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, 5855150 + ... + 5894663.
It is an arithmetic number, because the mean of its divisors is an integer number (30314520120).
Almost surely, 2232141055441 is an apocalyptic number.
It is an amenable number.
232141055441 is a deficient number, since it is larger than the sum of its proper divisors (10375105519).
232141055441 is a wasteful number, since it uses less digits than its factorization.
232141055441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11750695.
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 232141055441 its reverse (144550141232), we get a palindrome (376691196673).
The spelling of 232141055441 in words is "two hundred thirty-two billion, one hundred forty-one million, fifty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •