Base | Representation |
---|---|
bin | 1001001000011011011111… |
… | …0000000100110111001111 |
3 | 1022112212002020020100002112 |
4 | 2102012313300010313033 |
5 | 2304000240334412421 |
6 | 33204301140014235 |
7 | 2054253000534440 |
oct | 222066760046717 |
9 | 38485066210075 |
10 | 10040421404111 |
11 | 322113414721a |
12 | 1161a9899137b |
13 | 57aa66604917 |
14 | 269d5d6732c7 |
15 | 12629391a45b |
hex | 921b7c04dcf |
10040421404111 has 8 divisors (see below), whose sum is σ = 11474790495360. Its totient is φ = 8606058106968.
The previous prime is 10040421404023. The next prime is 10040421404149. The reversal of 10040421404111 is 11140412404001.
10040421404111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-10040421404111 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 (10040421404191) 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, 3304520 + ... + 5567826.
It is an arithmetic number, because the mean of its divisors is an integer number (1434348811920).
Almost surely, 210040421404111 is an apocalyptic number.
10040421404111 is a deficient number, since it is larger than the sum of its proper divisors (1434369091249).
10040421404111 is an equidigital number, since it uses as much as digits as its factorization.
10040421404111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2897053.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 10040421404111 its reverse (11140412404001), we get a palindrome (21180833808112).
The spelling of 10040421404111 in words is "ten trillion, forty billion, four hundred twenty-one million, four hundred four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •