Base | Representation |
---|---|
bin | 1001011110100110011110… |
… | …1111010001101001110101 |
3 | 1100220021021111001002210202 |
4 | 2113221213233101221311 |
5 | 2331220341230401141 |
6 | 34055254324530245 |
7 | 2123626204560044 |
oct | 227514757215165 |
9 | 40807244032722 |
10 | 10421331106421 |
11 | 33587307a9394 |
12 | 1203882850985 |
13 | 5a795bb7ac11 |
14 | 2805762b455b |
15 | 13113938e49b |
hex | 97a67bd1a75 |
10421331106421 has 8 divisors (see below), whose sum is σ = 10885354222080. Its totient is φ = 9964285782192.
The previous prime is 10421331106339. The next prime is 10421331106429. The reversal of 10421331106421 is 12460113312401.
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 10421331106421 - 230 = 10420257364597 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10421331106429) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1744444805 + ... + 1744450778.
It is an arithmetic number, because the mean of its divisors is an integer number (1360669277760).
Almost surely, 210421331106421 is an apocalyptic number.
It is an amenable number.
10421331106421 is a deficient number, since it is larger than the sum of its proper divisors (464023115659).
10421331106421 is a wasteful number, since it uses less digits than its factorization.
10421331106421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3488895715.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 10421331106421 its reverse (12460113312401), we get a palindrome (22881444418822).
The spelling of 10421331106421 in words is "ten trillion, four hundred twenty-one billion, three hundred thirty-one million, one hundred six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •