Base | Representation |
---|---|
bin | 1001001000011110001101… |
… | …1011111110010111010101 |
3 | 1022112220222022100221022020 |
4 | 2102013203123332113111 |
5 | 2304003241002111432 |
6 | 33204502001123353 |
7 | 2054310110400666 |
oct | 222074333762725 |
9 | 38486868327266 |
10 | 10041154332117 |
11 | 322147a936947 |
12 | 1162062329559 |
13 | 57ab5240292c |
14 | 269dccb3d36d |
15 | 1262d7e4422c |
hex | 921e36fe5d5 |
10041154332117 has 4 divisors (see below), whose sum is σ = 13388205776160. Its totient is φ = 6694102888076.
The previous prime is 10041154332101. The next prime is 10041154332149. The reversal of 10041154332117 is 71123345114001.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10041154332117 - 24 = 10041154332101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10041154332317) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1673525722017 + ... + 1673525722022.
It is an arithmetic number, because the mean of its divisors is an integer number (3347051444040).
Almost surely, 210041154332117 is an apocalyptic number.
It is an amenable number.
10041154332117 is a deficient number, since it is larger than the sum of its proper divisors (3347051444043).
10041154332117 is an equidigital number, since it uses as much as digits as its factorization.
10041154332117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3347051444042.
The product of its (nonzero) digits is 10080, while the sum is 33.
Adding to 10041154332117 its reverse (71123345114001), we get a palindrome (81164499446118).
The spelling of 10041154332117 in words is "ten trillion, forty-one billion, one hundred fifty-four million, three hundred thirty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •