Base | Representation |
---|---|
bin | 101010100000101… |
… | …1000011110001101 |
3 | 10200102001221021000 |
4 | 1111001120132031 |
5 | 10410131110431 |
6 | 353313130513 |
7 | 50230263426 |
oct | 12501303615 |
9 | 3612057230 |
10 | 1426425741 |
11 | 6721a8854 |
12 | 339859a39 |
13 | 1996a1900 |
14 | d763064d |
15 | 853649e6 |
hex | 5505878d |
1426425741 has 48 divisors (see below), whose sum is σ = 2408865600. Its totient is φ = 831549888.
The previous prime is 1426425733. The next prime is 1426425757. The reversal of 1426425741 is 1475246241.
1426425741 is a `hidden beast` number, since 1 + 4 + 2 + 642 + 5 + 7 + 4 + 1 = 666.
It is not a de Polignac number, because 1426425741 - 23 = 1426425733 is a prime.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1426425696 and 1426425705.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1426425731) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 78471 + ... + 94923.
It is an arithmetic number, because the mean of its divisors is an integer number (50184700).
Almost surely, 21426425741 is an apocalyptic number.
It is an amenable number.
1426425741 is a deficient number, since it is larger than the sum of its proper divisors (982439859).
1426425741 is a wasteful number, since it uses less digits than its factorization.
1426425741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16507 (or 16488 counting only the distinct ones).
The product of its digits is 53760, while the sum is 36.
The square root of 1426425741 is about 37768.0518560330. The cubic root of 1426425741 is about 1125.6837301497.
The spelling of 1426425741 in words is "one billion, four hundred twenty-six million, four hundred twenty-five thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •