Base | Representation |
---|---|
bin | 1001011110100110100001… |
… | …1000111111110100001001 |
3 | 1100220021022020121202112002 |
4 | 2113221220120333310021 |
5 | 2331220402030342101 |
6 | 34055255355200345 |
7 | 2123626366541222 |
oct | 227515030776411 |
9 | 40807266552462 |
10 | 10421342043401 |
11 | 3358736999513 |
12 | 12038864460b5 |
13 | 5a796120a0c3 |
14 | 280577920249 |
15 | 13113a2eed6b |
hex | 97a6863fd09 |
10421342043401 has 8 divisors (see below), whose sum is σ = 10667449821600. Its totient is φ = 10175404764672.
The previous prime is 10421342043391. The next prime is 10421342043407. The reversal of 10421342043401 is 10434024312401.
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 10421342043401 - 26 = 10421342043337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10421342043407) 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, 42501176 + ... + 42745673.
It is an arithmetic number, because the mean of its divisors is an integer number (1333431227700).
Almost surely, 210421342043401 is an apocalyptic number.
It is an amenable number.
10421342043401 is a deficient number, since it is larger than the sum of its proper divisors (246107778199).
10421342043401 is an equidigital number, since it uses as much as digits as its factorization.
10421342043401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85249735.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 10421342043401 its reverse (10434024312401), we get a palindrome (20855366355802).
The spelling of 10421342043401 in words is "ten trillion, four hundred twenty-one billion, three hundred forty-two million, forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •