Base | Representation |
---|---|
bin | 1001010011000100110110… |
… | …0011001000100010100011 |
3 | 1100012100011222021021120121 |
4 | 2110301031203020202203 |
5 | 2314444331221021011 |
6 | 33424310240421111 |
7 | 2103416323400530 |
oct | 224611543104243 |
9 | 40170158237517 |
10 | 10223323220131 |
11 | 329176148875a |
12 | 1191422317797 |
13 | 5920944a4668 |
14 | 274b509d7d87 |
15 | 12adeac70e71 |
hex | 94c4d8c88a3 |
10223323220131 has 16 divisors (see below), whose sum is σ = 11735856087040. Its totient is φ = 8723811650400.
The previous prime is 10223323220113. The next prime is 10223323220141. The reversal of 10223323220131 is 13102232332201.
It is not a de Polignac number, because 10223323220131 - 221 = 10223321122979 is a prime.
It is a super-2 number, since 2×102233232201312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10223323220096 and 10223323220105.
It is not an unprimeable number, because it can be changed into a prime (10223323220141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18240190 + ... + 18792316.
It is an arithmetic number, because the mean of its divisors is an integer number (733491005440).
Almost surely, 210223323220131 is an apocalyptic number.
10223323220131 is a deficient number, since it is larger than the sum of its proper divisors (1512532866909).
10223323220131 is a wasteful number, since it uses less digits than its factorization.
10223323220131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 563914.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 10223323220131 its reverse (13102232332201), we get a palindrome (23325555552332).
The spelling of 10223323220131 in words is "ten trillion, two hundred twenty-three billion, three hundred twenty-three million, two hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •