Base | Representation |
---|---|
bin | 1001000110101111000010… |
… | …1101101100110000011001 |
3 | 1022110001221120100012122202 |
4 | 2101223300231230300121 |
5 | 2303011131422430241 |
6 | 33143044451055545 |
7 | 2052202436403626 |
oct | 221536055546031 |
9 | 38401846305582 |
10 | 10011312311321 |
11 | 320a856894a42 |
12 | 11583142a15b5 |
13 | 5780a79a1569 |
14 | 26879b69934d |
15 | 12563d123d9b |
hex | 91af0b6cc19 |
10011312311321 has 8 divisors (see below), whose sum is σ = 10152540295488. Its totient is φ = 9870090538000.
The previous prime is 10011312311269. The next prime is 10011312311359. The reversal of 10011312311321 is 12311321311001.
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 10011312311321 - 210 = 10011312310297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10011312311293 and 10011312311302.
It is not an unprimeable number, because it can be changed into a prime (10011312311921) 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, 1742831 + ... + 4802091.
It is an arithmetic number, because the mean of its divisors is an integer number (1269067536936).
Almost surely, 210011312311321 is an apocalyptic number.
It is an amenable number.
10011312311321 is a deficient number, since it is larger than the sum of its proper divisors (141227984167).
10011312311321 is an equidigital number, since it uses as much as digits as its factorization.
10011312311321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3105423.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 10011312311321 its reverse (12311321311001), we get a palindrome (22322633622322).
The spelling of 10011312311321 in words is "ten trillion, eleven billion, three hundred twelve million, three hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •