Base | Representation |
---|---|
bin | 100110110111010000110… |
… | …1010000011100111001111 |
3 | 200220121222022121022110010 |
4 | 1031232201222003213033 |
5 | 1200003044231134201 |
6 | 15205441343044303 |
7 | 1060620536120133 |
oct | 115564152034717 |
9 | 20817868538403 |
10 | 5341356505551 |
11 | 177a290553570 |
12 | 7232355a0693 |
13 | 2c98c3005921 |
14 | 1467472c53c3 |
15 | 93e1aa19bd6 |
hex | 4dba1a839cf |
5341356505551 has 64 divisors (see below), whose sum is σ = 8246881714176. Its totient is φ = 3039132096000.
The previous prime is 5341356505543. The next prime is 5341356505613. The reversal of 5341356505551 is 1555056531435.
It is not a de Polignac number, because 5341356505551 - 23 = 5341356505543 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5341356505551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5341356505501) 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 63 ways as a sum of consecutive naturals, for example, 746934826 + ... + 746941976.
It is an arithmetic number, because the mean of its divisors is an integer number (128857526784).
Almost surely, 25341356505551 is an apocalyptic number.
5341356505551 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
5341356505551 is a deficient number, since it is larger than the sum of its proper divisors (2905525208625).
5341356505551 is a wasteful number, since it uses less digits than its factorization.
5341356505551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10332.
The product of its (nonzero) digits is 3375000, while the sum is 48.
The spelling of 5341356505551 in words is "five trillion, three hundred forty-one billion, three hundred fifty-six million, five hundred five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •