Base | Representation |
---|---|
bin | 1001001000100001010100… |
… | …0011101001000011110111 |
3 | 1022120000010022211102000221 |
4 | 2102020111003221003313 |
5 | 2304011442111023244 |
6 | 33205120340115211 |
7 | 2054336536361314 |
oct | 222102503510367 |
9 | 38500108742027 |
10 | 10041986814199 |
11 | 3221867842a6a |
12 | 1162255095b07 |
13 | 57ac55a19492 |
14 | 26a06b521d0b |
15 | 126336085784 |
hex | 922150e90f7 |
10041986814199 has 8 divisors (see below), whose sum is σ = 10217164530848. Its totient is φ = 9867149580960.
The previous prime is 10041986814187. The next prime is 10041986814217. The reversal of 10041986814199 is 99141868914001.
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 10041986814199 - 231 = 10039839330551 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (61).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10041986814109) 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, 85061352 + ... + 85179325.
It is an arithmetic number, because the mean of its divisors is an integer number (1277145566356).
Almost surely, 210041986814199 is an apocalyptic number.
10041986814199 is a deficient number, since it is larger than the sum of its proper divisors (175177716649).
10041986814199 is an equidigital number, since it uses as much as digits as its factorization.
10041986814199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170241705.
The product of its (nonzero) digits is 4478976, while the sum is 61.
The spelling of 10041986814199 in words is "ten trillion, forty-one billion, nine hundred eighty-six million, eight hundred fourteen thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •