Base | Representation |
---|---|
bin | 1100001110111001001… |
… | …11101110101101111101 |
3 | 1111011220100111101022021 |
4 | 12013130213232231331 |
5 | 23341300141331310 |
6 | 521031135120141 |
7 | 42236516336341 |
oct | 6073447565575 |
9 | 1434810441267 |
10 | 420313230205 |
11 | 152287951960 |
12 | 69562073051 |
13 | 30834b9699b |
14 | 164b3d03621 |
15 | adeedd85da |
hex | 61dc9eeb7d |
420313230205 has 8 divisors (see below), whose sum is σ = 550228228704. Its totient is φ = 305682349200.
The previous prime is 420313230167. The next prime is 420313230209. The reversal of 420313230205 is 502032313024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 420313230205 - 211 = 420313228157 is a prime.
It is a super-2 number, since 2×4203132302052 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 420313230205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420313230209) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3821029311 + ... + 3821029420.
It is an arithmetic number, because the mean of its divisors is an integer number (68778528588).
Almost surely, 2420313230205 is an apocalyptic number.
It is an amenable number.
420313230205 is a deficient number, since it is larger than the sum of its proper divisors (129914998499).
420313230205 is a wasteful number, since it uses less digits than its factorization.
420313230205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7642058747.
The product of its (nonzero) digits is 4320, while the sum is 25.
Adding to 420313230205 its reverse (502032313024), we get a palindrome (922345543229).
The spelling of 420313230205 in words is "four hundred twenty billion, three hundred thirteen million, two hundred thirty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •