Base | Representation |
---|---|
bin | 1001100111001… |
… | …0010110100110 |
3 | 2210212011210102 |
4 | 2121302112212 |
5 | 40310024103 |
6 | 4000024102 |
7 | 666444224 |
oct | 231622646 |
9 | 83764712 |
10 | 40314278 |
11 | 20835794 |
12 | 11602032 |
13 | 8476904 |
14 | 54d5b14 |
15 | 3814e88 |
hex | 26725a6 |
40314278 has 8 divisors (see below), whose sum is σ = 60521160. Its totient is φ = 20140560.
The previous prime is 40314271. The next prime is 40314289. The reversal of 40314278 is 87241304.
40314278 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×403142782 = 3250482021322568, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 40314278.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40314271) 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, 4988 + ... + 10271.
It is an arithmetic number, because the mean of its divisors is an integer number (7565145).
Almost surely, 240314278 is an apocalyptic number.
40314278 is a deficient number, since it is larger than the sum of its proper divisors (20206882).
40314278 is a wasteful number, since it uses less digits than its factorization.
40314278 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16582.
The product of its (nonzero) digits is 5376, while the sum is 29.
The square root of 40314278 is about 6349.3525654196. The cubic root of 40314278 is about 342.8885334520. Note that the first 3 decimals are identical.
The spelling of 40314278 in words is "forty million, three hundred fourteen thousand, two hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •