Base | Representation |
---|---|
bin | 1001000110010100001110… |
… | …0110111000110101000101 |
3 | 1022102101100211202101110011 |
4 | 2101211003212320311011 |
5 | 2302401410423200401 |
6 | 33135454235030221 |
7 | 2051526151203631 |
oct | 221450346706505 |
9 | 38371324671404 |
10 | 10004113100101 |
11 | 32077a2046aaa |
12 | 1156a4529b371 |
13 | 5774cb329373 |
14 | 2682b74c3dc1 |
15 | 12536b0a9451 |
hex | 919439b8d45 |
10004113100101 has 2 divisors, whose sum is σ = 10004113100102. Its totient is φ = 10004113100100.
The previous prime is 10004113100057. The next prime is 10004113100119. The reversal of 10004113100101 is 10100131140001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9832426348900 + 171686751201 = 3135670^2 + 414351^2 .
It is a cyclic number.
It is not a de Polignac number, because 10004113100101 - 211 = 10004113098053 is a prime.
It is a super-2 number, since 2×100041131001012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10004113100131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5002056550050 + 5002056550051.
It is an arithmetic number, because the mean of its divisors is an integer number (5002056550051).
Almost surely, 210004113100101 is an apocalyptic number.
It is an amenable number.
10004113100101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10004113100101 is an equidigital number, since it uses as much as digits as its factorization.
10004113100101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 10004113100101 its reverse (10100131140001), we get a palindrome (20104244240102).
The spelling of 10004113100101 in words is "ten trillion, four billion, one hundred thirteen million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •