Base | Representation |
---|---|
bin | 1001100100010… |
… | …0001110010101 |
3 | 2210111120121110 |
4 | 2121010032111 |
5 | 40233002313 |
6 | 3552005233 |
7 | 665026323 |
oct | 231041625 |
9 | 83446543 |
10 | 40125333 |
11 | 20716836 |
12 | 11530819 |
13 | 840b901 |
14 | 5486d13 |
15 | 37c8ec3 |
hex | 2644395 |
40125333 has 4 divisors (see below), whose sum is σ = 53500448. Its totient is φ = 26750220.
The previous prime is 40125331. The next prime is 40125341. The reversal of 40125333 is 33352104.
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 not a de Polignac number, because 40125333 - 21 = 40125331 is a prime.
It is a super-2 number, since 2×401253332 = 3220084696721778, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40125331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6687553 + ... + 6687558.
It is an arithmetic number, because the mean of its divisors is an integer number (13375112).
Almost surely, 240125333 is an apocalyptic number.
It is an amenable number.
40125333 is a deficient number, since it is larger than the sum of its proper divisors (13375115).
40125333 is a wasteful number, since it uses less digits than its factorization.
40125333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13375114.
The product of its (nonzero) digits is 1080, while the sum is 21.
The square root of 40125333 is about 6334.4560145288. The cubic root of 40125333 is about 342.3520109406.
Adding to 40125333 its reverse (33352104), we get a palindrome (73477437).
The spelling of 40125333 in words is "forty million, one hundred twenty-five thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •