Base | Representation |
---|---|
bin | 100111011100000010011… |
… | …1011011000110100000111 |
3 | 201012011211012210212020101 |
4 | 1032320010323120310013 |
5 | 1202301314314421201 |
6 | 15310022121144531 |
7 | 1066414602515110 |
oct | 116700473306407 |
9 | 21164735725211 |
10 | 5420331404551 |
11 | 17aa827852038 |
12 | 7365b602b147 |
13 | 30419a9523ab |
14 | 14a4b9c5b207 |
15 | 95eddee9d01 |
hex | 4ee04ed8d07 |
5420331404551 has 8 divisors (see below), whose sum is σ = 6194818016640. Its totient is φ = 4645883181048.
The previous prime is 5420331404473. The next prime is 5420331404591. The reversal of 5420331404551 is 1554041330245.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5420331404551 - 227 = 5420197186823 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 5420331404551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5420331404591) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9293941 + ... + 9859918.
It is an arithmetic number, because the mean of its divisors is an integer number (774352252080).
Almost surely, 25420331404551 is an apocalyptic number.
5420331404551 is a deficient number, since it is larger than the sum of its proper divisors (774486612089).
5420331404551 is a wasteful number, since it uses less digits than its factorization.
5420331404551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19194293.
The product of its (nonzero) digits is 144000, while the sum is 37.
Adding to 5420331404551 its reverse (1554041330245), we get a palindrome (6974372734796).
The spelling of 5420331404551 in words is "five trillion, four hundred twenty billion, three hundred thirty-one million, four hundred four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •