Base | Representation |
---|---|
bin | 10100101011110011111… |
… | …101001100010011010101 |
3 | 12000212222001021220112102 |
4 | 110223303331030103111 |
5 | 141242043110043331 |
6 | 3004555155131445 |
7 | 204460261413413 |
oct | 24536375142325 |
9 | 5025861256472 |
10 | 1421432112341 |
11 | 4a890a40952a |
12 | 1ab5968a3b85 |
13 | a406abc4857 |
14 | 4cb24ba22b3 |
15 | 26e949b54cb |
hex | 14af3f4c4d5 |
1421432112341 has 8 divisors (see below), whose sum is σ = 1505423745120. Its totient is φ = 1338358421232.
The previous prime is 1421432112337. The next prime is 1421432112343. The reversal of 1421432112341 is 1432112341241.
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 1421432112341 - 22 = 1421432112337 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1421432112343) 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, 229482230 + ... + 229488423.
It is an arithmetic number, because the mean of its divisors is an integer number (188177968140).
Almost surely, 21421432112341 is an apocalyptic number.
It is an amenable number.
1421432112341 is a deficient number, since it is larger than the sum of its proper divisors (83991632779).
1421432112341 is a wasteful number, since it uses less digits than its factorization.
1421432112341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458970835.
The product of its digits is 4608, while the sum is 29.
Adding to 1421432112341 its reverse (1432112341241), we get a palindrome (2853544453582).
The spelling of 1421432112341 in words is "one trillion, four hundred twenty-one billion, four hundred thirty-two million, one hundred twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •