Base | Representation |
---|---|
bin | 1111110001010000… |
… | …1010100000010101 |
3 | 101221000102000100202 |
4 | 3330110022200111 |
5 | 32132141104331 |
6 | 1540014550245 |
7 | 206621063456 |
oct | 37424124025 |
9 | 11830360322 |
10 | 4233144341 |
11 | 1882554aa8 |
12 | 9a1808385 |
13 | 526011c4a |
14 | 2c22c312d |
15 | 19b979ecb |
hex | fc50a815 |
4233144341 has 2 divisors, whose sum is σ = 4233144342. Its totient is φ = 4233144340.
The previous prime is 4233144299. The next prime is 4233144361. The reversal of 4233144341 is 1434413324.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3394810225 + 838334116 = 58265^2 + 28954^2 .
It is a cyclic number.
It is not a de Polignac number, because 4233144341 - 214 = 4233127957 is a prime.
It is a super-2 number, since 2×42331443412 = 35839022023480648562, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4233144361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2116572170 + 2116572171.
It is an arithmetic number, because the mean of its divisors is an integer number (2116572171).
Almost surely, 24233144341 is an apocalyptic number.
It is an amenable number.
4233144341 is a deficient number, since it is larger than the sum of its proper divisors (1).
4233144341 is an equidigital number, since it uses as much as digits as its factorization.
4233144341 is an evil number, because the sum of its binary digits is even.
The product of its digits is 13824, while the sum is 29.
The square root of 4233144341 is about 65062.6186146853. The cubic root of 4233144341 is about 1617.6616598217.
Adding to 4233144341 its reverse (1434413324), we get a palindrome (5667557665).
The spelling of 4233144341 in words is "four billion, two hundred thirty-three million, one hundred forty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.216 sec. • engine limits •