Base | Representation |
---|---|
bin | 1100001110111000100… |
… | …10001000111101010101 |
3 | 1111011212221211211200012 |
4 | 12013130102020331111 |
5 | 23341242214224032 |
6 | 521030413530005 |
7 | 42236420254652 |
oct | 6073422107525 |
9 | 1434787754605 |
10 | 420307570517 |
11 | 15228473672a |
12 | 695601a3905 |
13 | 30833964863 |
14 | 164b326cc29 |
15 | adee66b6b2 |
hex | 61dc488f55 |
420307570517 has 4 divisors (see below), whose sum is σ = 422737094220. Its totient is φ = 417878046816.
The previous prime is 420307570457. The next prime is 420307570523. The reversal of 420307570517 is 715075703024.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 226010864836 + 194296705681 = 475406^2 + 440791^2 .
It is a cyclic number.
It is not a de Polignac number, because 420307570517 - 28 = 420307570261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420307570217) 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, 1214761592 + ... + 1214761937.
It is an arithmetic number, because the mean of its divisors is an integer number (105684273555).
Almost surely, 2420307570517 is an apocalyptic number.
It is an amenable number.
420307570517 is a deficient number, since it is larger than the sum of its proper divisors (2429523703).
420307570517 is a wasteful number, since it uses less digits than its factorization.
420307570517 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2429523702.
The product of its (nonzero) digits is 205800, while the sum is 41.
The spelling of 420307570517 in words is "four hundred twenty billion, three hundred seven million, five hundred seventy thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •