Base | Representation |
---|---|
bin | 1001011000101101000101… |
… | …0000001011001001110011 |
3 | 1100112120210002022112001011 |
4 | 2112023101100023021303 |
5 | 2323040401130414443 |
6 | 33540541441451351 |
7 | 2113411524454516 |
oct | 226132120131163 |
9 | 40476702275034 |
10 | 10320022123123 |
11 | 331977349a809 |
12 | 11a810a640b57 |
13 | 59b23510965b |
14 | 2796c5474d7d |
15 | 12d6aa28cb9d |
hex | 962d140b273 |
10320022123123 has 32 divisors (see below), whose sum is σ = 10766020573440. Its totient is φ = 9887568912000.
The previous prime is 10320022123069. The next prime is 10320022123141. The reversal of 10320022123123 is 32132122002301.
It is a cyclic number.
It is not a de Polignac number, because 10320022123123 - 233 = 10311432188531 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10320022123094 and 10320022123103.
It is not an unprimeable number, because it can be changed into a prime (10320022123423) 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 31 ways as a sum of consecutive naturals, for example, 93143668 + ... + 93254398.
It is an arithmetic number, because the mean of its divisors is an integer number (336438142920).
Almost surely, 210320022123123 is an apocalyptic number.
10320022123123 is a deficient number, since it is larger than the sum of its proper divisors (445998450317).
10320022123123 is a wasteful number, since it uses less digits than its factorization.
10320022123123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111139.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10320022123123 its reverse (32132122002301), we get a palindrome (42452144125424).
The spelling of 10320022123123 in words is "ten trillion, three hundred twenty billion, twenty-two million, one hundred twenty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •