Base | Representation |
---|---|
bin | 11000110011011100001011… |
… | …01101101101100000010110 |
3 | 21011010100200110000002210121 |
4 | 30121232011231231200112 |
5 | 24122122134424411002 |
6 | 312001103255342154 |
7 | 14326450662126631 |
oct | 1431560555554026 |
9 | 234110613002717 |
10 | 54544033044502 |
11 | 16419aa376a221 |
12 | 614abba38195a |
13 | 24586321400a1 |
14 | d67d33c10c18 |
15 | 648c37336237 |
hex | 319b85b6d816 |
54544033044502 has 4 divisors (see below), whose sum is σ = 81816049566756. Its totient is φ = 27272016522250.
The previous prime is 54544033044463. The next prime is 54544033044521. The reversal of 54544033044502 is 20544033044545.
54544033044502 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×545440330445022 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 13636008261124 + ... + 13636008261127.
It is an arithmetic number, because the mean of its divisors is an integer number (20454012391689).
Almost surely, 254544033044502 is an apocalyptic number.
54544033044502 is a deficient number, since it is larger than the sum of its proper divisors (27272016522254).
54544033044502 is a wasteful number, since it uses less digits than its factorization.
54544033044502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27272016522253.
The product of its (nonzero) digits is 2304000, while the sum is 43.
Adding to 54544033044502 its sum of digits (43), we get a palindrome (54544033044545).
The spelling of 54544033044502 in words is "fifty-four trillion, five hundred forty-four billion, thirty-three million, forty-four thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.538 sec. • engine limits •