Base | Representation |
---|---|
bin | 100110100100010010… |
… | …011011110001010111 |
3 | 10221220000002211120202 |
4 | 212210102123301113 |
5 | 1134302204021211 |
6 | 31005101251115 |
7 | 2664126463412 |
oct | 464422336127 |
9 | 127800084522 |
10 | 41411001431 |
11 | 16620481328 |
12 | 8038563a9b |
13 | 3b9c4b3657 |
14 | 200bb44b79 |
15 | 112580153b |
hex | 9a449bc57 |
41411001431 has 8 divisors (see below), whose sum is σ = 41486160384. Its totient is φ = 41335912800.
The previous prime is 41411001409. The next prime is 41411001449. The reversal of 41411001431 is 13410011414.
41411001431 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 a de Polignac number, because none of the positive numbers 2k-41411001431 is a prime.
It is a super-2 number, since 2×414110014312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41411001451) 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, 1241585 + ... + 1274501.
It is an arithmetic number, because the mean of its divisors is an integer number (5185770048).
Almost surely, 241411001431 is an apocalyptic number.
41411001431 is a deficient number, since it is larger than the sum of its proper divisors (75158953).
41411001431 is a wasteful number, since it uses less digits than its factorization.
41411001431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35161.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 41411001431 its reverse (13410011414), we get a palindrome (54821012845).
The spelling of 41411001431 in words is "forty-one billion, four hundred eleven million, one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •