Base | Representation |
---|---|
bin | 1001010100010011000111… |
… | …0010011011011111000001 |
3 | 1100021100102010120100002212 |
4 | 2111010301302123133001 |
5 | 2320320343032214241 |
6 | 33442103054151505 |
7 | 2105062050562043 |
oct | 225046162333701 |
9 | 40240363510085 |
10 | 10244332304321 |
11 | 329a662575655 |
12 | 11955061b2595 |
13 | 594061c4a21b |
14 | 275b84d13a93 |
15 | 12b72a3b4beb |
hex | 95131c9b7c1 |
10244332304321 has 8 divisors (see below), whose sum is σ = 10483515841920. Its totient is φ = 10005191641872.
The previous prime is 10244332304317. The next prime is 10244332304363. The reversal of 10244332304321 is 12340323344201.
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 10244332304321 - 22 = 10244332304317 is a prime.
It is a super-2 number, since 2×102443323043212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10244332301321) 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, 10235090 + ... + 11191323.
It is an arithmetic number, because the mean of its divisors is an integer number (1310439480240).
Almost surely, 210244332304321 is an apocalyptic number.
It is an amenable number.
10244332304321 is a deficient number, since it is larger than the sum of its proper divisors (239183537599).
10244332304321 is a wasteful number, since it uses less digits than its factorization.
10244332304321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21437575.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 10244332304321 its reverse (12340323344201), we get a palindrome (22584655648522).
The spelling of 10244332304321 in words is "ten trillion, two hundred forty-four billion, three hundred thirty-two million, three hundred four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •