Base | Representation |
---|---|
bin | 100111000111101001… |
… | …010100011011100001 |
3 | 11000102100022121110212 |
4 | 213013221110123201 |
5 | 1142011034000413 |
6 | 31144011503505 |
7 | 3014621556626 |
oct | 470751243341 |
9 | 130370277425 |
10 | 42004203233 |
11 | 168a5306653 |
12 | 8183157b95 |
13 | 3c6536bb35 |
14 | 206683c34d |
15 | 115c929ca8 |
hex | 9c7a546e1 |
42004203233 has 2 divisors, whose sum is σ = 42004203234. Its totient is φ = 42004203232.
The previous prime is 42004203217. The next prime is 42004203239. The reversal of 42004203233 is 33230240024.
42004203233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32624668129 + 9379535104 = 180623^2 + 96848^2 .
It is a cyclic number.
It is not a de Polignac number, because 42004203233 - 24 = 42004203217 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 42004203199 and 42004203208.
It is not a weakly prime, because it can be changed into another prime (42004203239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21002101616 + 21002101617.
It is an arithmetic number, because the mean of its divisors is an integer number (21002101617).
Almost surely, 242004203233 is an apocalyptic number.
It is an amenable number.
42004203233 is a deficient number, since it is larger than the sum of its proper divisors (1).
42004203233 is an equidigital number, since it uses as much as digits as its factorization.
42004203233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 23.
Adding to 42004203233 its reverse (33230240024), we get a palindrome (75234443257).
The spelling of 42004203233 in words is "forty-two billion, four million, two hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •