Base | Representation |
---|---|
bin | 11000100011111011111100… |
… | …01101011111000001000011 |
3 | 21002020102200112112010211202 |
4 | 30101331332031133001003 |
5 | 24034410201242230311 |
6 | 310512244002331415 |
7 | 14243122065221624 |
oct | 1421757615370103 |
9 | 232212615463752 |
10 | 54011331211331 |
11 | 1623409343a51a |
12 | 6083911659b6b |
13 | 241a328c51290 |
14 | d4a23b7d3a4b |
15 | 639e5a7d0e3b |
hex | 311f7e35f043 |
54011331211331 has 16 divisors (see below), whose sum is σ = 58872407053824. Its totient is φ = 49251277180704.
The previous prime is 54011331211267. The next prime is 54011331211361. The reversal of 54011331211331 is 13311213311045.
It is a cyclic number.
It is not a de Polignac number, because 54011331211331 - 26 = 54011331211267 is a prime.
It is a super-2 number, since 2×540113312113312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 54011331211294 and 54011331211303.
It is not an unprimeable number, because it can be changed into a prime (54011331211361) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9085340 + ... + 13804566.
It is an arithmetic number, because the mean of its divisors is an integer number (3679525440864).
Almost surely, 254011331211331 is an apocalyptic number.
54011331211331 is a deficient number, since it is larger than the sum of its proper divisors (4861075842493).
54011331211331 is a wasteful number, since it uses less digits than its factorization.
54011331211331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4729930.
The product of its (nonzero) digits is 3240, while the sum is 29.
Adding to 54011331211331 its reverse (13311213311045), we get a palindrome (67322544522376).
The spelling of 54011331211331 in words is "fifty-four trillion, eleven billion, three hundred thirty-one million, two hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •