Base | Representation |
---|---|
bin | 10011001010100011100001… |
… | …01101101101111111100011 |
3 | 12112012221022111102120002102 |
4 | 21211101300231231333203 |
5 | 21010442114144011121 |
6 | 225344423101441015 |
7 | 11606545223405465 |
oct | 1145216055557743 |
9 | 175187274376072 |
10 | 42144110141411 |
11 | 12479242531083 |
12 | 488798927016b |
13 | 1a69232097055 |
14 | a59b003bc135 |
15 | 4d13e969a90b |
hex | 265470b6dfe3 |
42144110141411 has 4 divisors (see below), whose sum is σ = 42145160554392. Its totient is φ = 42143059728432.
The previous prime is 42144110141407. The next prime is 42144110141477. The reversal of 42144110141411 is 11414101144124.
It is a happy number.
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 42144110141411 - 22 = 42144110141407 is a prime.
It is a super-2 number, since 2×421441101414112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42144110141011) 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, 525146306 + ... + 525226551.
It is an arithmetic number, because the mean of its divisors is an integer number (10536290138598).
Almost surely, 242144110141411 is an apocalyptic number.
42144110141411 is a deficient number, since it is larger than the sum of its proper divisors (1050412981).
42144110141411 is a wasteful number, since it uses less digits than its factorization.
42144110141411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1050412980.
The product of its (nonzero) digits is 2048, while the sum is 29.
Adding to 42144110141411 its reverse (11414101144124), we get a palindrome (53558211285535).
The spelling of 42144110141411 in words is "forty-two trillion, one hundred forty-four billion, one hundred ten million, one hundred forty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •