Base | Representation |
---|---|
bin | 11000100101100100010011… |
… | …00000101001111100110001 |
3 | 21002102210021221211211100201 |
4 | 30102302021200221330301 |
5 | 24041314420433023243 |
6 | 310554111122315201 |
7 | 14250144316514305 |
oct | 1422621140517461 |
9 | 232383257754321 |
10 | 54067355361073 |
11 | 1625592262841a |
12 | 6092747ab8b01 |
13 | 24226b6a93c42 |
14 | d4cc3421bd05 |
15 | 63b638e7e04d |
hex | 312c89829f31 |
54067355361073 has 4 divisors (see below), whose sum is σ = 54369407625840. Its totient is φ = 53765303096308.
The previous prime is 54067355360969. The next prime is 54067355361077. The reversal of 54067355361073 is 37016355376045.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-54067355361073 is a prime.
It is a super-2 number, since 2×540673553610732 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54067355361077) 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, 151026132115 + ... + 151026132472.
It is an arithmetic number, because the mean of its divisors is an integer number (13592351906460).
Almost surely, 254067355361073 is an apocalyptic number.
It is an amenable number.
54067355361073 is a deficient number, since it is larger than the sum of its proper divisors (302052264767).
54067355361073 is a wasteful number, since it uses less digits than its factorization.
54067355361073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 302052264766.
The product of its (nonzero) digits is 23814000, while the sum is 55.
The spelling of 54067355361073 in words is "fifty-four trillion, sixty-seven billion, three hundred fifty-five million, three hundred sixty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •