Base | Representation |
---|---|
bin | 1001100110010… |
… | …1110101011000 |
3 | 2210202120110020 |
4 | 2121211311120 |
5 | 40301404000 |
6 | 3554550440 |
7 | 666141561 |
oct | 231456530 |
9 | 83676406 |
10 | 40263000 |
11 | 20800208 |
12 | 11598420 |
13 | 845947b |
14 | 54c1168 |
15 | 3804ba0 |
hex | 2665d58 |
40263000 has 64 divisors (see below), whose sum is σ = 125629920. Its totient is φ = 10736000.
The previous prime is 40262969. The next prime is 40263019. The reversal of 40263000 is 36204.
40263000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×402630002 = 3242218338000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 3711 + ... + 9710.
Almost surely, 240263000 is an apocalyptic number.
40263000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
40263000 is an abundant number, since it is smaller than the sum of its proper divisors (85366920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40263000 is a wasteful number, since it uses less digits than its factorization.
40263000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13445 (or 13431 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
The square root of 40263000 is about 6345.3132310391. The cubic root of 40263000 is about 342.7430920257.
Adding to 40263000 its reverse (36204), we get a palindrome (40299204).
The spelling of 40263000 in words is "forty million, two hundred sixty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •