Base | Representation |
---|---|
bin | 110000010010001100011101… |
… | …0111011010101110010101101 |
3 | 2001200210011210220021212021102 |
4 | 1200210120322323111302231 |
5 | 421131444434403312131 |
6 | 4103142303235412445 |
7 | 155313340104430004 |
oct | 14044307273256255 |
9 | 2050704726255242 |
10 | 424713124666541 |
11 | 113365908698147 |
12 | 3b7742ba154125 |
13 | 152ca377c37b09 |
14 | 76c4321247c3b |
15 | 3417b6a3a21cb |
hex | 182463aed5cad |
424713124666541 has 4 divisors (see below), whose sum is σ = 424914315158784. Its totient is φ = 424511934174300.
The previous prime is 424713124666487. The next prime is 424713124666553. The reversal of 424713124666541 is 145666421317424.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-424713124666541 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424713124606541) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100595242955 + ... + 100595247176.
It is an arithmetic number, because the mean of its divisors is an integer number (106228578789696).
Almost surely, 2424713124666541 is an apocalyptic number.
It is an amenable number.
424713124666541 is a deficient number, since it is larger than the sum of its proper divisors (201190492243).
424713124666541 is a wasteful number, since it uses less digits than its factorization.
424713124666541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201190492242.
The product of its digits is 23224320, while the sum is 56.
The spelling of 424713124666541 in words is "four hundred twenty-four trillion, seven hundred thirteen billion, one hundred twenty-four million, six hundred sixty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •