Base | Representation |
---|---|
bin | 10110011010010010001… |
… | …010010000011100011101 |
3 | 12110020010202122000111212 |
4 | 112122102022100130131 |
5 | 200213010404014201 |
6 | 3135253413554205 |
7 | 216156612605312 |
oct | 26322212203435 |
9 | 5406122560455 |
10 | 1540050454301 |
11 | 54414a3724a7 |
12 | 20a57b945965 |
13 | b22c2a82c88 |
14 | 5477880cd09 |
15 | 2a0d84eaabb |
hex | 1669229071d |
1540050454301 has 4 divisors (see below), whose sum is σ = 1542247388604. Its totient is φ = 1537853520000.
The previous prime is 1540050454289. The next prime is 1540050454339. The reversal of 1540050454301 is 1034540500451.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1115767577401 + 424282876900 = 1056299^2 + 651370^2 .
It is a cyclic number.
It is not a de Polignac number, because 1540050454301 - 230 = 1538976712477 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1540050451301) 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, 1098466100 + ... + 1098467501.
It is an arithmetic number, because the mean of its divisors is an integer number (385561847151).
Almost surely, 21540050454301 is an apocalyptic number.
It is an amenable number.
1540050454301 is a deficient number, since it is larger than the sum of its proper divisors (2196934303).
1540050454301 is an equidigital number, since it uses as much as digits as its factorization.
1540050454301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2196934302.
The product of its (nonzero) digits is 24000, while the sum is 32.
Adding to 1540050454301 its reverse (1034540500451), we get a palindrome (2574590954752).
The spelling of 1540050454301 in words is "one trillion, five hundred forty billion, fifty million, four hundred fifty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •