Base | Representation |
---|---|
bin | 100110100101101010… |
… | …101100111001000111 |
3 | 10221221121122102001100 |
4 | 212211222230321013 |
5 | 1134324114441411 |
6 | 31011245231143 |
7 | 2664530244441 |
oct | 464552547107 |
9 | 127847572040 |
10 | 41434140231 |
11 | 16632545900 |
12 | 80442624b3 |
13 | 3ba4225653 |
14 | 2010c49491 |
15 | 1127872456 |
hex | 9a5aace47 |
41434140231 has 18 divisors (see below), whose sum is σ = 65784784520. Its totient is φ = 25111599480.
The previous prime is 41434140221. The next prime is 41434140269. The reversal of 41434140231 is 13204143414.
41434140231 is a `hidden beast` number, since 4 + 14 + 3 + 414 + 0 + 231 = 666.
It is not a de Polignac number, because 41434140231 - 217 = 41434009159 is a prime.
It is a super-2 number, since 2×414341402312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41434140195 and 41434140204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41434140221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 19022851 + ... + 19025028.
Almost surely, 241434140231 is an apocalyptic number.
41434140231 is a deficient number, since it is larger than the sum of its proper divisors (24350644289).
41434140231 is a wasteful number, since it uses less digits than its factorization.
41434140231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38047907 (or 38047893 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 41434140231 its reverse (13204143414), we get a palindrome (54638283645).
The spelling of 41434140231 in words is "forty-one billion, four hundred thirty-four million, one hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •