Base | Representation |
---|---|
bin | 10100110110011110111… |
… | …100001101000101111001 |
3 | 12001222112121122001202012 |
4 | 110312132330031011321 |
5 | 141434030004120321 |
6 | 3014132204215305 |
7 | 205344236631161 |
oct | 24663674150571 |
9 | 5058477561665 |
10 | 1432890691961 |
11 | 50275a492a43 |
12 | 1b185423a535 |
13 | a5175b31091 |
14 | 4d4d09255a1 |
15 | 2741593a05b |
hex | 14d9ef0d179 |
1432890691961 has 8 divisors (see below), whose sum is σ = 1433445197184. Its totient is φ = 1432336301280.
The previous prime is 1432890691927. The next prime is 1432890692003. The reversal of 1432890691961 is 1691960982341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1432890691961 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1432890691961.
It is not an unprimeable number, because it can be changed into a prime (1432890891961) 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 7 ways as a sum of consecutive naturals, for example, 31219916 + ... + 31265778.
It is an arithmetic number, because the mean of its divisors is an integer number (179180649648).
Almost surely, 21432890691961 is an apocalyptic number.
It is an amenable number.
1432890691961 is a deficient number, since it is larger than the sum of its proper divisors (554505223).
1432890691961 is an equidigital number, since it uses as much as digits as its factorization.
1432890691961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57271.
The product of its (nonzero) digits is 5038848, while the sum is 59.
The spelling of 1432890691961 in words is "one trillion, four hundred thirty-two billion, eight hundred ninety million, six hundred ninety-one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •