Base | Representation |
---|---|
bin | 100101101001111100… |
… | …011000101110001001 |
3 | 10212100210012200120201 |
4 | 211221330120232021 |
5 | 1130301112040431 |
6 | 30324013052201 |
7 | 2630642355430 |
oct | 455174305611 |
9 | 125323180521 |
10 | 40432143241 |
11 | 16168988716 |
12 | 7a04787061 |
13 | 3a74769519 |
14 | 1d57b3c117 |
15 | 10b98e9461 |
hex | 969f18b89 |
40432143241 has 8 divisors (see below), whose sum is σ = 48640172480. Its totient is φ = 32832116208.
The previous prime is 40432143229. The next prime is 40432143251. The reversal of 40432143241 is 14234123404.
40432143241 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 cyclic number.
It is not a de Polignac number, because 40432143241 - 25 = 40432143209 is a prime.
It is a super-3 number, since 3×404321432413 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40432143251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 152000406 + ... + 152000671.
It is an arithmetic number, because the mean of its divisors is an integer number (6080021560).
Almost surely, 240432143241 is an apocalyptic number.
It is an amenable number.
40432143241 is a deficient number, since it is larger than the sum of its proper divisors (8208029239).
40432143241 is a wasteful number, since it uses less digits than its factorization.
40432143241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304001103.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 40432143241 its reverse (14234123404), we get a palindrome (54666266645).
The spelling of 40432143241 in words is "forty billion, four hundred thirty-two million, one hundred forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •