Base | Representation |
---|---|
bin | 10100011001001100011… |
… | …010110000010000110101 |
3 | 11221222100212021112110102 |
4 | 110121030122300100311 |
5 | 140430123000422331 |
6 | 2551451401203445 |
7 | 203152011344504 |
oct | 24311432602065 |
9 | 4858325245412 |
10 | 1401441420341 |
11 | 4a0391167776 |
12 | 1a7737a90585 |
13 | a2203428811 |
14 | 4bb89c2083b |
15 | 266c49874cb |
hex | 1464c6b0435 |
1401441420341 has 8 divisors (see below), whose sum is σ = 1465545844224. Its totient is φ = 1337601345520.
The previous prime is 1401441420331. The next prime is 1401441420347. The reversal of 1401441420341 is 1430241441041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1401441420341 - 26 = 1401441420277 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 (1401441420347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66076421 + ... + 66097626.
It is an arithmetic number, because the mean of its divisors is an integer number (183193230528).
Almost surely, 21401441420341 is an apocalyptic number.
It is an amenable number.
1401441420341 is a deficient number, since it is larger than the sum of its proper divisors (64104423883).
1401441420341 is a wasteful number, since it uses less digits than its factorization.
1401441420341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132174531.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 1401441420341 its reverse (1430241441041), we get a palindrome (2831682861382).
The spelling of 1401441420341 in words is "one trillion, four hundred one billion, four hundred forty-one million, four hundred twenty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •