Base | Representation |
---|---|
bin | 10101010000110010110… |
… | …110011010101101100111 |
3 | 12011200110111110112210222 |
4 | 111100302312122231213 |
5 | 142414404323203011 |
6 | 3035123412034555 |
7 | 210364314064106 |
oct | 25206266325547 |
9 | 5150414415728 |
10 | 1461142006631 |
11 | 51373763088a |
12 | 1b7219602a5b |
13 | a7a28b31a18 |
14 | 50a10a1403d |
15 | 2801ac94ddb |
hex | 15432d9ab67 |
1461142006631 has 4 divisors (see below), whose sum is σ = 1462998604632. Its totient is φ = 1459285408632.
The previous prime is 1461142006607. The next prime is 1461142006637. The reversal of 1461142006631 is 1366002411641.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1461142006631 is a prime.
It is a super-3 number, since 3×14611420066313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1461142006591 and 1461142006600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1461142006637) 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, 928297820 + ... + 928299393.
It is an arithmetic number, because the mean of its divisors is an integer number (365749651158).
Almost surely, 21461142006631 is an apocalyptic number.
1461142006631 is a deficient number, since it is larger than the sum of its proper divisors (1856598001).
1461142006631 is an equidigital number, since it uses as much as digits as its factorization.
1461142006631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1856598000.
The product of its (nonzero) digits is 20736, while the sum is 35.
The spelling of 1461142006631 in words is "one trillion, four hundred sixty-one billion, one hundred forty-two million, six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •