Base | Representation |
---|---|
bin | 1001100100001… |
… | …0111110101001 |
3 | 2210111022121120 |
4 | 2121002332221 |
5 | 40232321413 |
6 | 3551525453 |
7 | 665005416 |
oct | 231027651 |
9 | 83438546 |
10 | 40120233 |
11 | 20712a1a |
12 | 11529889 |
13 | 84094aa |
14 | 548510d |
15 | 37c7723 |
hex | 2642fa9 |
40120233 has 4 divisors (see below), whose sum is σ = 53493648. Its totient is φ = 26746820.
The previous prime is 40120219. The next prime is 40120259. The reversal of 40120233 is 33202104.
40120233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 40120233 - 24 = 40120217 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (40120273) 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 in 3 ways as a sum of consecutive naturals, for example, 6686703 + ... + 6686708.
It is an arithmetic number, because the mean of its divisors is an integer number (13373412).
Almost surely, 240120233 is an apocalyptic number.
It is an amenable number.
40120233 is a deficient number, since it is larger than the sum of its proper divisors (13373415).
40120233 is a wasteful number, since it uses less digits than its factorization.
40120233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13373414.
The product of its (nonzero) digits is 144, while the sum is 15.
The square root of 40120233 is about 6334.0534415175. The cubic root of 40120233 is about 342.3375058129.
Adding to 40120233 its reverse (33202104), we get a palindrome (73322337).
The spelling of 40120233 in words is "forty million, one hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •