Base | Representation |
---|---|
bin | 10110011010100011101… |
… | …010111011101001010101 |
3 | 12110020220020102111111010 |
4 | 112122203222323221111 |
5 | 200214111110420113 |
6 | 3135342510402433 |
7 | 216200110642521 |
oct | 26324352735125 |
9 | 5406806374433 |
10 | 1540344232533 |
11 | 544290187427 |
12 | 20a642200419 |
13 | b233b8b2b52 |
14 | 547a5842d81 |
15 | 2a1041cb1c3 |
hex | 166a3abba55 |
1540344232533 has 16 divisors (see below), whose sum is σ = 2146011419520. Its totient is φ = 980908425024.
The previous prime is 1540344232529. The next prime is 1540344232541. The reversal of 1540344232533 is 3352324430451.
It is not a de Polignac number, because 1540344232533 - 22 = 1540344232529 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1540344232491 and 1540344232500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1540344232523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15177138 + ... + 15278291.
It is an arithmetic number, because the mean of its divisors is an integer number (134125713720).
Almost surely, 21540344232533 is an apocalyptic number.
It is an amenable number.
1540344232533 is a deficient number, since it is larger than the sum of its proper divisors (605667186987).
1540344232533 is a wasteful number, since it uses less digits than its factorization.
1540344232533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30456188.
The product of its (nonzero) digits is 518400, while the sum is 39.
Adding to 1540344232533 its reverse (3352324430451), we get a palindrome (4892668662984).
The spelling of 1540344232533 in words is "one trillion, five hundred forty billion, three hundred forty-four million, two hundred thirty-two thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •