Base | Representation |
---|---|
bin | 1101100111110011010… |
… | …0000000001111001111 |
3 | 211101001102010121112222 |
4 | 3121330310000033033 |
5 | 12313234143204411 |
6 | 255301444445555 |
7 | 22623201141452 |
oct | 3317464001717 |
9 | 741042117488 |
10 | 234022241231 |
11 | 902804aa639 |
12 | 394316a98bb |
13 | 190b6ac226c |
14 | b4807cd499 |
15 | 614a2684db |
hex | 367cd003cf |
234022241231 has 4 divisors (see below), whose sum is σ = 234028023600. Its totient is φ = 234016458864.
The previous prime is 234022241209. The next prime is 234022241261. The reversal of 234022241231 is 132142220432.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 234022241231 - 214 = 234022224847 is a prime.
It is a super-2 number, since 2×2340222412312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 234022241231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (234022241261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2830046 + ... + 2911563.
It is an arithmetic number, because the mean of its divisors is an integer number (58507005900).
Almost surely, 2234022241231 is an apocalyptic number.
234022241231 is a deficient number, since it is larger than the sum of its proper divisors (5782369).
234022241231 is an equidigital number, since it uses as much as digits as its factorization.
234022241231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5782368.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 234022241231 its reverse (132142220432), we get a palindrome (366164461663).
The spelling of 234022241231 in words is "two hundred thirty-four billion, twenty-two million, two hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •