Base | Representation |
---|---|
bin | 1111001000001110… |
… | …0000110110000001 |
3 | 101111000111112122022 |
4 | 3302003200312001 |
5 | 31304104212413 |
6 | 1510545251225 |
7 | 202430664143 |
oct | 36203406601 |
9 | 11430445568 |
10 | 4061007233 |
11 | 17a4372928 |
12 | 954033b15 |
13 | 4c9461c7a |
14 | 2a74b4c93 |
15 | 18b7c6608 |
hex | f20e0d81 |
4061007233 has 2 divisors, whose sum is σ = 4061007234. Its totient is φ = 4061007232.
The previous prime is 4061007227. The next prime is 4061007239. The reversal of 4061007233 is 3327001604.
It is a balanced prime because it is at equal distance from previous prime (4061007227) and next prime (4061007239).
It can be written as a sum of positive squares in only one way, i.e., 2900037904 + 1160969329 = 53852^2 + 34073^2 .
It is a cyclic number.
It is not a de Polignac number, because 4061007233 - 26 = 4061007169 is a prime.
It is not a weakly prime, because it can be changed into another prime (4061007239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2030503616 + 2030503617.
It is an arithmetic number, because the mean of its divisors is an integer number (2030503617).
Almost surely, 24061007233 is an apocalyptic number.
It is an amenable number.
4061007233 is a deficient number, since it is larger than the sum of its proper divisors (1).
4061007233 is an equidigital number, since it uses as much as digits as its factorization.
4061007233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 26.
The square root of 4061007233 is about 63726.0326161923. The cubic root of 4061007233 is about 1595.4306129918.
Adding to 4061007233 its reverse (3327001604), we get a palindrome (7388008837).
The spelling of 4061007233 in words is "four billion, sixty-one million, seven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •