Base | Representation |
---|---|
bin | 101111000010111101… |
… | …000111111011010101 |
3 | 11211101111201102001122 |
4 | 233002331013323111 |
5 | 1311423423142123 |
6 | 35112333133325 |
7 | 3435551120141 |
oct | 570275077325 |
9 | 154344642048 |
10 | 50515443413 |
11 | 1a472718346 |
12 | 995962a245 |
13 | 49c07a1226 |
14 | 2632d86221 |
15 | 14a9c5dbc8 |
hex | bc2f47ed5 |
50515443413 has 4 divisors (see below), whose sum is σ = 50528850060. Its totient is φ = 50502036768.
The previous prime is 50515443397. The next prime is 50515443479. The reversal of 50515443413 is 31434451505.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31434451505 = 5 ⋅6286890301.
It can be written as a sum of positive squares in 2 ways, for example, as 45991804849 + 4523638564 = 214457^2 + 67258^2 .
It is a cyclic number.
It is not a de Polignac number, because 50515443413 - 24 = 50515443397 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 (50515443313) 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, 6697670 + ... + 6705207.
It is an arithmetic number, because the mean of its divisors is an integer number (12632212515).
Almost surely, 250515443413 is an apocalyptic number.
It is an amenable number.
50515443413 is a deficient number, since it is larger than the sum of its proper divisors (13406647).
50515443413 is a wasteful number, since it uses less digits than its factorization.
50515443413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13406646.
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 50515443413 its reverse (31434451505), we get a palindrome (81949894918).
The spelling of 50515443413 in words is "fifty billion, five hundred fifteen million, four hundred forty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •