Base | Representation |
---|---|
bin | 1001010011000011110000… |
… | …1000110100101100001101 |
3 | 1100012022102121121120101011 |
4 | 2110300330020310230031 |
5 | 2314443231431013123 |
6 | 33424221243445221 |
7 | 2103406145452642 |
oct | 224607410645415 |
9 | 40168377546334 |
10 | 10223031110413 |
11 | 3291621603370 |
12 | 1191360526811 |
13 | 592048b0a084 |
14 | 274b23cb9dc9 |
15 | 12add02bee0d |
hex | 94c3c234b0d |
10223031110413 has 8 divisors (see below), whose sum is σ = 11237530382496. Its totient is φ = 9222720639600.
The previous prime is 10223031110399. The next prime is 10223031110447. The reversal of 10223031110413 is 31401113032201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10223031110413 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10223031111413) 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, 3547198806 + ... + 3547201687.
It is an arithmetic number, because the mean of its divisors is an integer number (1404691297812).
Almost surely, 210223031110413 is an apocalyptic number.
It is an amenable number.
10223031110413 is a deficient number, since it is larger than the sum of its proper divisors (1014499272083).
10223031110413 is a wasteful number, since it uses less digits than its factorization.
10223031110413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7094400635.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 10223031110413 its reverse (31401113032201), we get a palindrome (41624144142614).
The spelling of 10223031110413 in words is "ten trillion, two hundred twenty-three billion, thirty-one million, one hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.190 sec. • engine limits •