Base | Representation |
---|---|
bin | 10011001001010101110110… |
… | …10100010111100110000111 |
3 | 12112001221200111020022022100 |
4 | 21210222323110113212013 |
5 | 21004301220000124221 |
6 | 225313325304203143 |
7 | 11603541010130403 |
oct | 1144527324274607 |
9 | 175057614208270 |
10 | 42102412114311 |
11 | 1246259503815a |
12 | 487b8907694b3 |
13 | 1a653182a9233 |
14 | a57aa64c0103 |
15 | 4d02a8a9e926 |
hex | 264abb517987 |
42102412114311 has 12 divisors (see below), whose sum is σ = 64015363448920. Its totient is φ = 26590997124720.
The previous prime is 42102412114303. The next prime is 42102412114313. The reversal of 42102412114311 is 11341121420124.
42102412114311 is a `hidden beast` number, since 4 + 2 + 10 + 2 + 4 + 1 + 211 + 431 + 1 = 666.
It is not a de Polignac number, because 42102412114311 - 23 = 42102412114303 is a prime.
It is a super-2 number, since 2×421024121143112 (a number of 28 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 (42102412114313) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 123106468000 + ... + 123106468341.
Almost surely, 242102412114311 is an apocalyptic number.
42102412114311 is a deficient number, since it is larger than the sum of its proper divisors (21912951334609).
42102412114311 is a wasteful number, since it uses less digits than its factorization.
42102412114311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 246212936366 (or 246212936363 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 42102412114311 its reverse (11341121420124), we get a palindrome (53443533534435).
The spelling of 42102412114311 in words is "forty-two trillion, one hundred two billion, four hundred twelve million, one hundred fourteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •