Base | Representation |
---|---|
bin | 1001001101111000000110… |
… | …1001101100001111000101 |
3 | 1022212210122002121001200011 |
4 | 2103132001221230033011 |
5 | 2312013414234304341 |
6 | 33315255143150221 |
7 | 2064105020402623 |
oct | 223360151541705 |
9 | 38783562531604 |
10 | 10134003041221 |
11 | 3257896584284 |
12 | 1178055145371 |
13 | 58682b477aa7 |
14 | 2706ba100513 |
15 | 12891e42cb81 |
hex | 93781a6c3c5 |
10134003041221 has 8 divisors (see below), whose sum is σ = 10139835882240. Its totient is φ = 10128171005568.
The previous prime is 10134003041213. The next prime is 10134003041251. The reversal of 10134003041221 is 12214030043101.
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 10134003041221 - 23 = 10134003041213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10134003041192 and 10134003041201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10134003041251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25944450 + ... + 26332156.
It is an arithmetic number, because the mean of its divisors is an integer number (1267479485280).
Almost surely, 210134003041221 is an apocalyptic number.
It is an amenable number.
10134003041221 is a deficient number, since it is larger than the sum of its proper divisors (5832841019).
10134003041221 is a wasteful number, since it uses less digits than its factorization.
10134003041221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402683.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 10134003041221 its reverse (12214030043101), we get a palindrome (22348033084322).
The spelling of 10134003041221 in words is "ten trillion, one hundred thirty-four billion, three million, forty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •