Base | Representation |
---|---|
bin | 100100101111110101111… |
… | …0101110001000111111001 |
3 | 122212211100001021110220121 |
4 | 1021133223311301013321 |
5 | 1130222003042012101 |
6 | 14424104303053241 |
7 | 1030614112560025 |
oct | 111375365610771 |
9 | 18784301243817 |
10 | 5050543313401 |
11 | 1677a1803aa53 |
12 | 6969b48a1221 |
13 | 2a8358572ac1 |
14 | 13663a305385 |
15 | 8b599b380a1 |
hex | 497ebd711f9 |
5050543313401 has 4 divisors (see below), whose sum is σ = 5050558197412. Its totient is φ = 5050528429392.
The previous prime is 5050543313371. The next prime is 5050543313411. The reversal of 5050543313401 is 1043133450505.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2648821350400 + 2401721963001 = 1627520^2 + 1549749^2 .
It is a cyclic number.
It is not a de Polignac number, because 5050543313401 - 211 = 5050543311353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5050543313411) 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, 6920850 + ... + 7615723.
It is an arithmetic number, because the mean of its divisors is an integer number (1262639549353).
Almost surely, 25050543313401 is an apocalyptic number.
It is an amenable number.
5050543313401 is a deficient number, since it is larger than the sum of its proper divisors (14884011).
5050543313401 is a wasteful number, since it uses less digits than its factorization.
5050543313401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14884010.
The product of its (nonzero) digits is 54000, while the sum is 34.
Adding to 5050543313401 its reverse (1043133450505), we get a palindrome (6093676763906).
The spelling of 5050543313401 in words is "five trillion, fifty billion, five hundred forty-three million, three hundred thirteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •