Base | Representation |
---|---|
bin | 100100110010001010111… |
… | …0111010000001101011001 |
3 | 122220022020111122210020212 |
4 | 1021210111313100031121 |
5 | 1130312223042010431 |
6 | 14430252354300505 |
7 | 1031152035064031 |
oct | 111442567201531 |
9 | 18808214583225 |
10 | 5055543313241 |
11 | 167a053447923 |
12 | 69796b287735 |
13 | 2a89744015a5 |
14 | 1369923a68c1 |
15 | 8b78da8e72b |
hex | 49915dd0359 |
5055543313241 has 4 divisors (see below), whose sum is σ = 5067551730084. Its totient is φ = 5043534896400.
The previous prime is 5055543313193. The next prime is 5055543313291. The reversal of 5055543313241 is 1423133455505.
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 11746007641 + 5043797305600 = 108379^2 + 2245840^2 .
It is a cyclic number.
It is not a de Polignac number, because 5055543313241 - 210 = 5055543312217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5055543313291) 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, 6004207790 + ... + 6004208631.
It is an arithmetic number, because the mean of its divisors is an integer number (1266887932521).
Almost surely, 25055543313241 is an apocalyptic number.
It is an amenable number.
5055543313241 is a deficient number, since it is larger than the sum of its proper divisors (12008416843).
5055543313241 is a wasteful number, since it uses less digits than its factorization.
5055543313241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12008416842.
The product of its (nonzero) digits is 540000, while the sum is 41.
Adding to 5055543313241 its reverse (1423133455505), we get a palindrome (6478676768746).
The spelling of 5055543313241 in words is "five trillion, fifty-five billion, five hundred forty-three million, three hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •