Base | Representation |
---|---|
bin | 1001011000101101110100… |
… | …1000000101101110010010 |
3 | 1100112121021222011021221120 |
4 | 2112023131020011232102 |
5 | 2323041303130032242 |
6 | 33541013315303110 |
7 | 2113416463630521 |
oct | 226133510055622 |
9 | 40477258137846 |
10 | 10320221330322 |
11 | 3319865991062 |
12 | 11a81652aaa96 |
13 | 59b267476b37 |
14 | 279703acc4b8 |
15 | 12d6bc9dc1ec |
hex | 962dd205b92 |
10320221330322 has 8 divisors (see below), whose sum is σ = 20640442660656. Its totient is φ = 3440073776772.
The previous prime is 10320221330317. The next prime is 10320221330323. The reversal of 10320221330322 is 22303312202301.
It is a sphenic number, since it is the product of 3 distinct primes.
10320221330322 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 10320221330292 and 10320221330301.
It is not an unprimeable number, because it can be changed into a prime (10320221330323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 860018444188 + ... + 860018444199.
It is an arithmetic number, because the mean of its divisors is an integer number (2580055332582).
Almost surely, 210320221330322 is an apocalyptic number.
10320221330322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10320221330322 is a wasteful number, since it uses less digits than its factorization.
10320221330322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1720036888392.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 10320221330322 its reverse (22303312202301), we get a palindrome (32623533532623).
The spelling of 10320221330322 in words is "ten trillion, three hundred twenty billion, two hundred twenty-one million, three hundred thirty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •