Base | Representation |
---|---|
bin | 101111110000000000101111… |
… | …0101100011011011001110001 |
3 | 2001002011001012122021220121220 |
4 | 1133200001132230123121301 |
5 | 420023011240302442223 |
6 | 4045144124041135253 |
7 | 154320041001146502 |
oct | 13740013654333161 |
9 | 2032131178256556 |
10 | 420015030515313 |
11 | 111914412a58312 |
12 | 3b135887a8a529 |
13 | 1504932a7a321c |
14 | 75a0b9bb90ba9 |
15 | 338584c8056e3 |
hex | 17e005eb1b671 |
420015030515313 has 4 divisors (see below), whose sum is σ = 560020040687088. Its totient is φ = 280010020343540.
The previous prime is 420015030515299. The next prime is 420015030515321. The reversal of 420015030515313 is 313515030510024.
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 not a de Polignac number, because 420015030515313 - 212 = 420015030511217 is a prime.
It is a super-3 number, since 3×4200150305153133 (a number of 45 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (420015030516313) 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, 70002505085883 + ... + 70002505085888.
It is an arithmetic number, because the mean of its divisors is an integer number (140005010171772).
Almost surely, 2420015030515313 is an apocalyptic number.
It is an amenable number.
420015030515313 is a deficient number, since it is larger than the sum of its proper divisors (140005010171775).
420015030515313 is a wasteful number, since it uses less digits than its factorization.
420015030515313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140005010171774.
The product of its (nonzero) digits is 27000, while the sum is 33.
The spelling of 420015030515313 in words is "four hundred twenty trillion, fifteen billion, thirty million, five hundred fifteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •