Base | Representation |
---|---|
bin | 10011000110101111010111… |
… | …10010111001110110101111 |
3 | 12111202101222101002221112110 |
4 | 21203113223302321312233 |
5 | 21001320141431041421 |
6 | 225204304155135103 |
7 | 11564225035136223 |
oct | 1143275362716657 |
9 | 174671871087473 |
10 | 42013031112111 |
11 | 124286988702a4 |
12 | 48664a7144493 |
13 | 1a59a727a4a57 |
14 | a536278b2783 |
15 | 4cccc6c44a76 |
hex | 2635ebcb9daf |
42013031112111 has 4 divisors (see below), whose sum is σ = 56017374816152. Its totient is φ = 28008687408072.
The previous prime is 42013031112089. The next prime is 42013031112131. The reversal of 42013031112111 is 11121113031024.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 42013031112111 - 25 = 42013031112079 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 (42013031112131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7002171852016 + ... + 7002171852021.
It is an arithmetic number, because the mean of its divisors is an integer number (14004343704038).
Almost surely, 242013031112111 is an apocalyptic number.
42013031112111 is a deficient number, since it is larger than the sum of its proper divisors (14004343704041).
42013031112111 is a wasteful number, since it uses less digits than its factorization.
42013031112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14004343704040.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 42013031112111 its reverse (11121113031024), we get a palindrome (53134144143135).
The spelling of 42013031112111 in words is "forty-two trillion, thirteen billion, thirty-one million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •