Base | Representation |
---|---|
bin | 10011010001101111000111… |
… | …10011110011110110011101 |
3 | 12120002112012112000012022100 |
4 | 21220313203303303312131 |
5 | 21024012432142111411 |
6 | 230054031204235313 |
7 | 11633431612640202 |
oct | 1150674363636635 |
9 | 176075175005270 |
10 | 42390854253981 |
11 | 1256395110a972 |
12 | 490776b39bb39 |
13 | 1a8659574a31c |
14 | a67a2a617ca9 |
15 | 4d7a3b727456 |
hex | 268de3cf3d9d |
42390854253981 has 12 divisors (see below), whose sum is σ = 61320884347008. Its totient is φ = 28219192383624.
The previous prime is 42390854253893. The next prime is 42390854254031. The reversal of 42390854253981 is 18935245809324.
42390854253981 is a `hidden beast` number, since 4 + 2 + 3 + 9 + 0 + 8 + 542 + 5 + 3 + 9 + 81 = 666.
It is not a de Polignac number, because 42390854253981 - 215 = 42390854221213 is a prime.
It is a super-2 number, since 2×423908542539812 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42390854251981) 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, 3448086765 + ... + 3448099058.
It is an arithmetic number, because the mean of its divisors is an integer number (5110073695584).
Almost surely, 242390854253981 is an apocalyptic number.
It is an amenable number.
42390854253981 is a deficient number, since it is larger than the sum of its proper divisors (18930030093027).
42390854253981 is a wasteful number, since it uses less digits than its factorization.
42390854253981 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6896186512 (or 6896186509 counting only the distinct ones).
The product of its (nonzero) digits is 74649600, while the sum is 63.
The spelling of 42390854253981 in words is "forty-two trillion, three hundred ninety billion, eight hundred fifty-four million, two hundred fifty-three thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •