Base | Representation |
---|---|
bin | 110100110110010110010011… |
… | …000110001111011011011011 |
3 | 1010110222101202020221111202120 |
4 | 310312112103012033123123 |
5 | 220431141210014410233 |
6 | 2142202202144432323 |
7 | 66646513461441345 |
oct | 6466262306173333 |
9 | 1113871666844676 |
10 | 232433213044443 |
11 | 68073410273444 |
12 | 2209b1449186a3 |
13 | 9c90486520938 |
14 | 4157b82a90295 |
15 | 1bd11c44914b3 |
hex | d3659318f6db |
232433213044443 has 8 divisors (see below), whose sum is σ = 310330316020800. Its totient is φ = 154745792715528.
The previous prime is 232433213044399. The next prime is 232433213044471. The reversal of 232433213044443 is 344440312334232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 232433213044443 - 229 = 232432676173531 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 232433213044395 and 232433213044404.
It is not an unprimeable number, because it can be changed into a prime (232433213044343) 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, 52420659273 + ... + 52420663706.
It is an arithmetic number, because the mean of its divisors is an integer number (38791289502600).
Almost surely, 2232433213044443 is an apocalyptic number.
232433213044443 is a deficient number, since it is larger than the sum of its proper divisors (77897102976357).
232433213044443 is a wasteful number, since it uses less digits than its factorization.
232433213044443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104841323721.
The product of its (nonzero) digits is 1990656, while the sum is 42.
Adding to 232433213044443 its reverse (344440312334232), we get a palindrome (576873525378675).
The spelling of 232433213044443 in words is "two hundred thirty-two trillion, four hundred thirty-three billion, two hundred thirteen million, forty-four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •