Base | Representation |
---|---|
bin | 111100010000101000001… |
… | …101010001011001110111 |
3 | 112122212201000102110022001 |
4 | 330100220031101121313 |
5 | 1020321303344304033 |
6 | 12450205411120131 |
7 | 605115261036502 |
oct | 74205015213167 |
9 | 15585630373261 |
10 | 4141023041143 |
11 | 135721a60675a |
12 | 56a6842a3047 |
13 | 24065c604301 |
14 | 1045d8796139 |
15 | 72ab690ee7d |
hex | 3c428351677 |
4141023041143 has 4 divisors (see below), whose sum is σ = 4152306483040. Its totient is φ = 4129739599248.
The previous prime is 4141023041093. The next prime is 4141023041209. The reversal of 4141023041143 is 3411403201414.
4141023041143 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4141023041143 - 29 = 4141023040631 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4141023041443) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5641720398 + ... + 5641721131.
It is an arithmetic number, because the mean of its divisors is an integer number (1038076620760).
Almost surely, 24141023041143 is an apocalyptic number.
4141023041143 is a deficient number, since it is larger than the sum of its proper divisors (11283441897).
4141023041143 is a wasteful number, since it uses less digits than its factorization.
4141023041143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11283441896.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 4141023041143 its reverse (3411403201414), we get a palindrome (7552426242557).
The spelling of 4141023041143 in words is "four trillion, one hundred forty-one billion, twenty-three million, forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •