Base | Representation |
---|---|
bin | 111101011001000010101111… |
… | …1110101011011101011110011 |
3 | 2121210222211112221100012210211 |
4 | 1322302011133311123223303 |
5 | 1031234404233024020311 |
6 | 5152254112344204551 |
7 | 221512653253156114 |
oct | 17262053765335363 |
9 | 2553884487305724 |
10 | 540003551001331 |
11 | 14707524674978a |
12 | 50694380769757 |
13 | 1a241168843b71 |
14 | 974c4503ac20b |
15 | 4266ae924d821 |
hex | 1eb215fd5baf3 |
540003551001331 has 2 divisors, whose sum is σ = 540003551001332. Its totient is φ = 540003551001330.
The previous prime is 540003551001323. The next prime is 540003551001449. The reversal of 540003551001331 is 133100155300045.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 540003551001331 - 23 = 540003551001323 is a prime.
It is a super-2 number, since 2×5400035510013312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 540003551001293 and 540003551001302.
It is not a weakly prime, because it can be changed into another prime (540003551001731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 270001775500665 + 270001775500666.
It is an arithmetic number, because the mean of its divisors is an integer number (270001775500666).
Almost surely, 2540003551001331 is an apocalyptic number.
540003551001331 is a deficient number, since it is larger than the sum of its proper divisors (1).
540003551001331 is an equidigital number, since it uses as much as digits as its factorization.
540003551001331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 31.
The spelling of 540003551001331 in words is "five hundred forty trillion, three billion, five hundred fifty-one million, one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •