Base | Representation |
---|---|
bin | 1101101011010100101… |
… | …0100001111101000001 |
3 | 211110111022010101211021 |
4 | 3122311022201331001 |
5 | 12322203210424333 |
6 | 255535340345441 |
7 | 22655501150335 |
oct | 3326512417501 |
9 | 743438111737 |
10 | 234967670593 |
11 | 90716140717 |
12 | 39656245281 |
13 | 19207933816 |
14 | b5301b37c5 |
15 | 61a326a82d |
hex | 36b52a1f41 |
234967670593 has 2 divisors, whose sum is σ = 234967670594. Its totient is φ = 234967670592.
The previous prime is 234967670591. The next prime is 234967670657. The reversal of 234967670593 is 395076769432.
234967670593 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 213045018624 + 21922651969 = 461568^2 + 148063^2 .
It is a cyclic number.
It is not a de Polignac number, because 234967670593 - 21 = 234967670591 is a prime.
Together with 234967670591, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (234967670591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 117483835296 + 117483835297.
It is an arithmetic number, because the mean of its divisors is an integer number (117483835297).
Almost surely, 2234967670593 is an apocalyptic number.
It is an amenable number.
234967670593 is a deficient number, since it is larger than the sum of its proper divisors (1).
234967670593 is an equidigital number, since it uses as much as digits as its factorization.
234967670593 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51438240, while the sum is 61.
The spelling of 234967670593 in words is "two hundred thirty-four billion, nine hundred sixty-seven million, six hundred seventy thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •