Base | Representation |
---|---|
bin | 1001100010101… |
… | …1011001100110 |
3 | 2210022102010120 |
4 | 2120223121212 |
5 | 40221224104 |
6 | 3545502410 |
7 | 664124016 |
oct | 230533146 |
9 | 83272116 |
10 | 40023654 |
11 | 20657400 |
12 | 114a1a06 |
13 | 83a4548 |
14 | 545bc46 |
15 | 37a8cd9 |
hex | 262b666 |
40023654 has 48 divisors (see below), whose sum is σ = 91067760. Its totient is φ = 11704000.
The previous prime is 40023631. The next prime is 40023689. The reversal of 40023654 is 45632004.
40023654 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 23 ways as a sum of consecutive naturals, for example, 20104 + ... + 22004.
It is an arithmetic number, because the mean of its divisors is an integer number (1897245).
Almost surely, 240023654 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40023654, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45533880).
40023654 is an abundant number, since it is smaller than the sum of its proper divisors (51044106).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40023654 is a wasteful number, since it uses less digits than its factorization.
40023654 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1957 (or 1946 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 24.
The square root of 40023654 is about 6326.4250568548. The cubic root of 40023654 is about 342.0625890032.
Adding to 40023654 its reverse (45632004), we get a palindrome (85655658).
The spelling of 40023654 in words is "forty million, twenty-three thousand, six hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •