Base | Representation |
---|---|
bin | 11100100001011101… |
… | …01001101001011101 |
3 | 1110112012012112211121 |
4 | 32100232221221131 |
5 | 222330120101310 |
6 | 11011255450541 |
7 | 1051320531145 |
oct | 162056515135 |
9 | 43465175747 |
10 | 15313050205 |
11 | 65488aa2a2 |
12 | 2b74386a51 |
13 | 15a0665b6b |
14 | a53a33925 |
15 | 5e95500da |
hex | 390ba9a5d |
15313050205 has 4 divisors (see below), whose sum is σ = 18375660252. Its totient is φ = 12250440160.
The previous prime is 15313050167. The next prime is 15313050211. The reversal of 15313050205 is 50205031351.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50205031351 = 32479 ⋅1545769.
It can be written as a sum of positive squares in 2 ways, for example, as 9451922841 + 5861127364 = 97221^2 + 76558^2 .
It is a de Polignac number, because none of the positive numbers 2k-15313050205 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 15313050205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1531305016 + ... + 1531305025.
It is an arithmetic number, because the mean of its divisors is an integer number (4593915063).
Almost surely, 215313050205 is an apocalyptic number.
It is an amenable number.
15313050205 is a deficient number, since it is larger than the sum of its proper divisors (3062610047).
15313050205 is an equidigital number, since it uses as much as digits as its factorization.
15313050205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3062610046.
The product of its (nonzero) digits is 2250, while the sum is 25.
Adding to 15313050205 its reverse (50205031351), we get a palindrome (65518081556).
The spelling of 15313050205 in words is "fifteen billion, three hundred thirteen million, fifty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •