Base | Representation |
---|---|
bin | 1001011000110001001000… |
… | …1010110000011101100001 |
3 | 1100112200120222122110222210 |
4 | 2112030102022300131201 |
5 | 2323100113433101423 |
6 | 33541241504552333 |
7 | 2113450520606316 |
oct | 226142212603541 |
9 | 40480528573883 |
10 | 10321111222113 |
11 | 331a182239a1a |
12 | 11a83733226a9 |
13 | 59b379941623 |
14 | 279789d76d0d |
15 | 12d720bbdb93 |
hex | 963122b0761 |
10321111222113 has 8 divisors (see below), whose sum is σ = 14133413565568. Its totient is φ = 6694774846704.
The previous prime is 10321111222073. The next prime is 10321111222127. The reversal of 10321111222113 is 31122211112301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10321111222113 - 212 = 10321111218017 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10321111222113.
It is not an unprimeable number, because it can be changed into a prime (10321111222193) 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, 46491491881 + ... + 46491492102.
It is an arithmetic number, because the mean of its divisors is an integer number (1766676695696).
Almost surely, 210321111222113 is an apocalyptic number.
It is an amenable number.
10321111222113 is a deficient number, since it is larger than the sum of its proper divisors (3812302343455).
10321111222113 is an equidigital number, since it uses as much as digits as its factorization.
10321111222113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92982984023.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 10321111222113 its reverse (31122211112301), we get a palindrome (41443322334414).
The spelling of 10321111222113 in words is "ten trillion, three hundred twenty-one billion, one hundred eleven million, two hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •