Base | Representation |
---|---|
bin | 1001011000110001100011… |
… | …0010100010000010110001 |
3 | 1100112200212201200102211020 |
4 | 2112030120302202002301 |
5 | 2323100330402441423 |
6 | 33541300514010053 |
7 | 2113453340061006 |
oct | 226143062420261 |
9 | 40480781612736 |
10 | 10321222312113 |
11 | 331a229a15539 |
12 | 11a83a4576929 |
13 | 59b396968b5b |
14 | 27979aa138ad |
15 | 12d72a8144e3 |
hex | 96318ca20b1 |
10321222312113 has 8 divisors (see below), whose sum is σ = 13785815392800. Its totient is φ = 6868722053088.
The previous prime is 10321222312103. The next prime is 10321222312253. The reversal of 10321222312113 is 31121322212301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10321222312113 - 210 = 10321222311089 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10321222312103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3023203423 + ... + 3023206836.
It is an arithmetic number, because the mean of its divisors is an integer number (1723226924100).
Almost surely, 210321222312113 is an apocalyptic number.
It is an amenable number.
10321222312113 is a deficient number, since it is larger than the sum of its proper divisors (3464593080687).
10321222312113 is an equidigital number, since it uses as much as digits as its factorization.
10321222312113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6046410831.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 10321222312113 its reverse (31121322212301), we get a palindrome (41442544524414).
The spelling of 10321222312113 in words is "ten trillion, three hundred twenty-one billion, two hundred twenty-two million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •