Base | Representation |
---|---|
bin | 1001000110010100101101… |
… | …0000000110001011100001 |
3 | 1022102101200210001210220121 |
4 | 2101211023100012023201 |
5 | 2302402141240440301 |
6 | 33135515055440241 |
7 | 2051532266226340 |
oct | 221451320061341 |
9 | 38371623053817 |
10 | 10004241343201 |
11 | 3207858478a36 |
12 | 1156a80226081 |
13 | 57751ba7b261 |
14 | 2682ca547b57 |
15 | 12537748c3a1 |
hex | 9194b4062e1 |
10004241343201 has 8 divisors (see below), whose sum is σ = 11436882327104. Its totient is φ = 8572466271600.
The previous prime is 10004241343163. The next prime is 10004241343207. The reversal of 10004241343201 is 10234314240001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10004241343201 - 27 = 10004241343073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10004241343207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 216453315 + ... + 216499528.
It is an arithmetic number, because the mean of its divisors is an integer number (1429610290888).
Almost surely, 210004241343201 is an apocalyptic number.
It is an amenable number.
10004241343201 is a deficient number, since it is larger than the sum of its proper divisors (1432640983903).
10004241343201 is an equidigital number, since it uses as much as digits as its factorization.
10004241343201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432956151.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 10004241343201 its reverse (10234314240001), we get a palindrome (20238555583202).
The spelling of 10004241343201 in words is "ten trillion, four billion, two hundred forty-one million, three hundred forty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •