Base | Representation |
---|---|
bin | 1001011101011010110000… |
… | …1010110101111010011101 |
3 | 1100211022210212122201221121 |
4 | 2113112230022311322131 |
5 | 2330402224103101122 |
6 | 34042053323530541 |
7 | 2122306404142633 |
oct | 227265412657235 |
9 | 40738725581847 |
10 | 10401004347037 |
11 | 335004a889197 |
12 | 11bb94b389a51 |
13 | 5a5a6c896545 |
14 | 27d5a8851353 |
15 | 130849acabc7 |
hex | 975ac2b5e9d |
10401004347037 has 8 divisors (see below), whose sum is σ = 10950029460000. Its totient is φ = 9852139617264.
The previous prime is 10401004347007. The next prime is 10401004347049. The reversal of 10401004347037 is 73074340010401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10401004347037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10401004346993 and 10401004347011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10401004347007) 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, 39962662 + ... + 40222087.
It is an arithmetic number, because the mean of its divisors is an integer number (1368753682500).
Almost surely, 210401004347037 is an apocalyptic number.
It is an amenable number.
10401004347037 is a deficient number, since it is larger than the sum of its proper divisors (549025112963).
10401004347037 is an equidigital number, since it uses as much as digits as its factorization.
10401004347037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80191595.
The product of its (nonzero) digits is 28224, while the sum is 34.
Adding to 10401004347037 its reverse (73074340010401), we get a palindrome (83475344357438).
The spelling of 10401004347037 in words is "ten trillion, four hundred one billion, four million, three hundred forty-seven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •