Base | Representation |
---|---|
bin | 1001000110010000111010… |
… | …0000000010001100100101 |
3 | 1022102022001202012110012022 |
4 | 2101210032200002030211 |
5 | 2302343044330023023 |
6 | 33135230010032525 |
7 | 2051465112005045 |
oct | 221441640021445 |
9 | 38368052173168 |
10 | 10003222111013 |
11 | 320738510978a |
12 | 1156836a18745 |
13 | 5773b88692a1 |
14 | 268231031725 |
15 | 125317c5c7c8 |
hex | 9190e802325 |
10003222111013 has 8 divisors (see below), whose sum is σ = 10007274495456. Its totient is φ = 9999170017200.
The previous prime is 10003222110989. The next prime is 10003222111031. The reversal of 10003222111013 is 31011122230001.
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 10003222111013 - 216 = 10003222045477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10003222110982 and 10003222111000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10003222111913) 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, 91742618 + ... + 91851588.
It is an arithmetic number, because the mean of its divisors is an integer number (1250909311932).
Almost surely, 210003222111013 is an apocalyptic number.
It is an amenable number.
10003222111013 is a deficient number, since it is larger than the sum of its proper divisors (4052384443).
10003222111013 is a wasteful number, since it uses less digits than its factorization.
10003222111013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145315.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10003222111013 its reverse (31011122230001), we get a palindrome (41014344341014).
The spelling of 10003222111013 in words is "ten trillion, three billion, two hundred twenty-two million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •