Base | Representation |
---|---|
bin | 10110010101001001110… |
… | …001011100000001000101 |
3 | 12102200220210122211012000 |
4 | 112111021301130001011 |
5 | 200120220000140003 |
6 | 3132543003415513 |
7 | 215603233315302 |
oct | 26251161340105 |
9 | 5380823584160 |
10 | 1534541021253 |
11 | 541882445949 |
12 | 2094a2824599 |
13 | b1925518816 |
14 | 543b4c1c0a9 |
15 | 29db49b61a3 |
hex | 16549c5c045 |
1534541021253 has 16 divisors (see below), whose sum is σ = 2273413190400. Its totient is φ = 1023018759360.
The previous prime is 1534541021213. The next prime is 1534541021257. The reversal of 1534541021253 is 3521201454351.
1534541021253 is a `hidden beast` number, since 1 + 5 + 345 + 41 + 0 + 21 + 253 = 666.
It is not a de Polignac number, because 1534541021253 - 29 = 1534541020741 is a prime.
It is a super-2 number, since 2×15345410212532 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1534541021257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6082068 + ... + 6329346.
It is an arithmetic number, because the mean of its divisors is an integer number (142088324400).
Almost surely, 21534541021253 is an apocalyptic number.
It is an amenable number.
1534541021253 is a deficient number, since it is larger than the sum of its proper divisors (738872169147).
1534541021253 is a wasteful number, since it uses less digits than its factorization.
1534541021253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477129 (or 477123 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The spelling of 1534541021253 in words is "one trillion, five hundred thirty-four billion, five hundred forty-one million, twenty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •