Base | Representation |
---|---|
bin | 10011010010000010000100… |
… | …11001100110110101000011 |
3 | 12120010111110202122100000201 |
4 | 21221001002121212311003 |
5 | 21024144302433430021 |
6 | 230102433110430031 |
7 | 11634242036112454 |
oct | 1151010231466503 |
9 | 176114422570021 |
10 | 42401031155011 |
11 | 125681a3770281 |
12 | 490972b662317 |
13 | 1a87527c94c59 |
14 | a6831406912b |
15 | 4d7e34dca591 |
hex | 269042666d43 |
42401031155011 has 4 divisors (see below), whose sum is σ = 43387101647032. Its totient is φ = 41414960662992.
The previous prime is 42401031154981. The next prime is 42401031155039. The reversal of 42401031155011 is 11055113010424.
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 42401031155011 - 213 = 42401031146819 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42401031195011) 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 3 ways as a sum of consecutive naturals, for example, 493035245946 + ... + 493035246031.
It is an arithmetic number, because the mean of its divisors is an integer number (10846775411758).
Almost surely, 242401031155011 is an apocalyptic number.
42401031155011 is a deficient number, since it is larger than the sum of its proper divisors (986070492021).
42401031155011 is an equidigital number, since it uses as much as digits as its factorization.
42401031155011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 986070492020.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 42401031155011 its reverse (11055113010424), we get a palindrome (53456144165435).
The spelling of 42401031155011 in words is "forty-two trillion, four hundred one billion, thirty-one million, one hundred fifty-five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •