Base | Representation |
---|---|
bin | 10100111101011010011… |
… | …011101100011100100111 |
3 | 12002200202011100202102002 |
4 | 110331122123230130213 |
5 | 142044244300103133 |
6 | 3021402401235515 |
7 | 206026515436430 |
oct | 24753233543447 |
9 | 5080664322362 |
10 | 1440331253543 |
11 | 505928496a96 |
12 | 1b3190032b9b |
13 | a5a904aa940 |
14 | 4d9d8ba4487 |
15 | 276edc7ace8 |
hex | 14f5a6ec727 |
1440331253543 has 16 divisors (see below), whose sum is σ = 1801776303936. Its totient is φ = 1120920733440.
The previous prime is 1440331253533. The next prime is 1440331253549. The reversal of 1440331253543 is 3453521330441.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1440331253543 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1440331253497 and 1440331253506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1440331253549) 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, 129730646 + ... + 129741747.
It is an arithmetic number, because the mean of its divisors is an integer number (112611018996).
Almost surely, 21440331253543 is an apocalyptic number.
1440331253543 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1440331253543 is a deficient number, since it is larger than the sum of its proper divisors (361445050393).
1440331253543 is a wasteful number, since it uses less digits than its factorization.
1440331253543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259472474.
The product of its (nonzero) digits is 259200, while the sum is 38.
Adding to 1440331253543 its reverse (3453521330441), we get a palindrome (4893852583984).
The spelling of 1440331253543 in words is "one trillion, four hundred forty billion, three hundred thirty-one million, two hundred fifty-three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •