Base | Representation |
---|---|
bin | 1101100111101110100… |
… | …0010101001010110101 |
3 | 211101000000210210000111 |
4 | 3121323220111022311 |
5 | 12313214103412041 |
6 | 255255455343021 |
7 | 22622540421151 |
oct | 3317350251265 |
9 | 741000723014 |
10 | 234002404021 |
11 | 90270290651 |
12 | 39426b21a71 |
13 | 190b2967c79 |
14 | b47bd08061 |
15 | 614864a981 |
hex | 367ba152b5 |
234002404021 has 2 divisors, whose sum is σ = 234002404022. Its totient is φ = 234002404020.
The previous prime is 234002404007. The next prime is 234002404079. The reversal of 234002404021 is 120404200432.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 223360212100 + 10642191921 = 472610^2 + 103161^2 .
It is a cyclic number.
It is not a de Polignac number, because 234002404021 - 213 = 234002395829 is a prime.
It is a super-3 number, since 3×2340024040213 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 234002403983 and 234002404001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (234002404121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 117001202010 + 117001202011.
It is an arithmetic number, because the mean of its divisors is an integer number (117001202011).
Almost surely, 2234002404021 is an apocalyptic number.
It is an amenable number.
234002404021 is a deficient number, since it is larger than the sum of its proper divisors (1).
234002404021 is an equidigital number, since it uses as much as digits as its factorization.
234002404021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 22.
Adding to 234002404021 its reverse (120404200432), we get a palindrome (354406604453).
The spelling of 234002404021 in words is "two hundred thirty-four billion, two million, four hundred four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •