Base | Representation |
---|---|
bin | 11100101110001101… |
… | …11100111111101101 |
3 | 1110210122121102212211 |
4 | 32113012330333231 |
5 | 223040020143310 |
6 | 11030041530421 |
7 | 1054060360501 |
oct | 162706747755 |
9 | 43718542784 |
10 | 15420084205 |
11 | 65a3265549 |
12 | 2ba41a3a11 |
13 | 15b98a01a6 |
14 | a63d36301 |
15 | 603b43c8a |
hex | 3971bcfed |
15420084205 has 8 divisors (see below), whose sum is σ = 18853235352. Its totient is φ = 12103311168.
The previous prime is 15420084203. The next prime is 15420084241. The reversal of 15420084205 is 50248002451.
It can be written as a sum of positive squares in 4 ways, for example, as 6760292841 + 8659791364 = 82221^2 + 93058^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 15420084205 - 21 = 15420084203 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 (15420084203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29094234 + ... + 29094763.
It is an arithmetic number, because the mean of its divisors is an integer number (2356654419).
Almost surely, 215420084205 is an apocalyptic number.
It is an amenable number.
15420084205 is a deficient number, since it is larger than the sum of its proper divisors (3433151147).
15420084205 is an equidigital number, since it uses as much as digits as its factorization.
15420084205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58189055.
The product of its (nonzero) digits is 12800, while the sum is 31.
Adding to 15420084205 its reverse (50248002451), we get a palindrome (65668086656).
The spelling of 15420084205 in words is "fifteen billion, four hundred twenty million, eighty-four thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •