Base | Representation |
---|---|
bin | 10101010000111100011… |
… | …010110110101000110111 |
3 | 12011200212200120011020002 |
4 | 111100330122312220313 |
5 | 142420221423200033 |
6 | 3035151345101515 |
7 | 210401303520536 |
oct | 25207432665067 |
9 | 5150780504202 |
10 | 1461302553143 |
11 | 51380a216854 |
12 | 1b726332789b |
13 | a7a53184164 |
14 | 50a2808631d |
15 | 28029e093e8 |
hex | 1543c6b6a37 |
1461302553143 has 8 divisors (see below), whose sum is σ = 1463991865488. Its totient is φ = 1458614622784.
The previous prime is 1461302553107. The next prime is 1461302553229. The reversal of 1461302553143 is 3413552031641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1461302553143 - 220 = 1461301504567 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1461302553097 and 1461302553106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1461302553043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1783280 + ... + 2470362.
It is an arithmetic number, because the mean of its divisors is an integer number (182998983186).
Almost surely, 21461302553143 is an apocalyptic number.
1461302553143 is a deficient number, since it is larger than the sum of its proper divisors (2689312345).
1461302553143 is an equidigital number, since it uses as much as digits as its factorization.
1461302553143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 690993.
The product of its (nonzero) digits is 129600, while the sum is 38.
Adding to 1461302553143 its reverse (3413552031641), we get a palindrome (4874854584784).
The spelling of 1461302553143 in words is "one trillion, four hundred sixty-one billion, three hundred two million, five hundred fifty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •