Base | Representation |
---|---|
bin | 100111101100001100111… |
… | …0000001010101100101110 |
3 | 201022111102011010202202220 |
4 | 1033120121300022230232 |
5 | 1203333410333214204 |
6 | 15334002214100210 |
7 | 1102053663250323 |
oct | 117303160125456 |
9 | 21274364122686 |
10 | 5455040523054 |
11 | 1813519187541 |
12 | 74128204a666 |
13 | 30753c81b835 |
14 | 14c04d888b4a |
15 | 96d7126d1d9 |
hex | 4f619c0ab2e |
5455040523054 has 8 divisors (see below), whose sum is σ = 10910081046120. Its totient is φ = 1818346841016.
The previous prime is 5455040523041. The next prime is 5455040523077. The reversal of 5455040523054 is 4503250405545.
It is a sphenic number, since it is the product of 3 distinct primes.
5455040523054 is an admirable number.
It is a super-2 number, since 2×54550405230542 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5455040522997 and 5455040523015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 454586710249 + ... + 454586710260.
It is an arithmetic number, because the mean of its divisors is an integer number (1363760130765).
Almost surely, 25455040523054 is an apocalyptic number.
5455040523054 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5455040523054 is a wasteful number, since it uses less digits than its factorization.
5455040523054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909173420514.
The product of its (nonzero) digits is 1200000, while the sum is 42.
Adding to 5455040523054 its reverse (4503250405545), we get a palindrome (9958290928599).
The spelling of 5455040523054 in words is "five trillion, four hundred fifty-five billion, forty million, five hundred twenty-three thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •