Base | Representation |
---|---|
bin | 1001100110010… |
… | …1111001010101 |
3 | 2210202120210121 |
4 | 2121211321111 |
5 | 40301411003 |
6 | 3554551541 |
7 | 666142402 |
oct | 231457125 |
9 | 83676717 |
10 | 40263253 |
11 | 20800418 |
12 | 115985b1 |
13 | 8459614 |
14 | 54c12a9 |
15 | 3804cbd |
hex | 2665e55 |
40263253 has 4 divisors (see below), whose sum is σ = 40284108. Its totient is φ = 40242400.
The previous prime is 40263247. The next prime is 40263257. The reversal of 40263253 is 35236204.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4765489 + 35497764 = 2183^2 + 5958^2 .
It is a cyclic number.
It is not a de Polignac number, because 40263253 - 217 = 40132181 is a prime.
It is a super-2 number, since 2×402632532 = 3242259084284018, 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 (40263257) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7198 + ... + 11503.
It is an arithmetic number, because the mean of its divisors is an integer number (10071027).
Almost surely, 240263253 is an apocalyptic number.
It is an amenable number.
40263253 is a deficient number, since it is larger than the sum of its proper divisors (20855).
40263253 is a wasteful number, since it uses less digits than its factorization.
40263253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20854.
The product of its (nonzero) digits is 4320, while the sum is 25.
The square root of 40263253 is about 6345.3331669819. Note that the first 3 decimals coincide. The cubic root of 40263253 is about 342.7438099207.
Adding to 40263253 its reverse (35236204), we get a palindrome (75499457).
The spelling of 40263253 in words is "forty million, two hundred sixty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •