Base | Representation |
---|---|
bin | 1001001000011110011000… |
… | …1111010011000000000111 |
3 | 1022112221002120211012120121 |
4 | 2102013212033103000013 |
5 | 2304003340020343143 |
6 | 33204510400442411 |
7 | 2054311221065311 |
oct | 222074617230007 |
9 | 38487076735517 |
10 | 10041201340423 |
11 | 32214a4423990 |
12 | 1162076019407 |
13 | 57ab5c0813b6 |
14 | 269dd50987b1 |
15 | 1262dc12c7ed |
hex | 921e63d3007 |
10041201340423 has 8 divisors (see below), whose sum is σ = 10954336085136. Its totient is φ = 9128116305600.
The previous prime is 10041201340381. The next prime is 10041201340433. The reversal of 10041201340423 is 32404310214001.
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 10041201340423 - 225 = 10041167785991 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 (10041201340433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12004486 + ... + 12813667.
It is an arithmetic number, because the mean of its divisors is an integer number (1369292010642).
Almost surely, 210041201340423 is an apocalyptic number.
10041201340423 is a deficient number, since it is larger than the sum of its proper divisors (913134744713).
10041201340423 is a wasteful number, since it uses less digits than its factorization.
10041201340423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24854945.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 10041201340423 its reverse (32404310214001), we get a palindrome (42445511554424).
The spelling of 10041201340423 in words is "ten trillion, forty-one billion, two hundred one million, three hundred forty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •