Base | Representation |
---|---|
bin | 1001000110001001110101… |
… | …0000000111011111111101 |
3 | 1022102010011100000112221022 |
4 | 2101202131100013133331 |
5 | 2302330201430104041 |
6 | 33134313254313525 |
7 | 2051400041204231 |
oct | 221423520073775 |
9 | 38363140015838 |
10 | 10001322113021 |
11 | 320659a665108 |
12 | 11563a66588a5 |
13 | 577175036615 |
14 | 2680d09685c1 |
15 | 12525605024b |
hex | 9189d4077fd |
10001322113021 has 8 divisors (see below), whose sum is σ = 10173496709760. Its totient is φ = 9829236205152.
The previous prime is 10001322112963. The next prime is 10001322113047. The reversal of 10001322113021 is 12031122310001.
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 10001322113021 - 234 = 9984142243837 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001322113071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21944720 + ... + 22395833.
It is an arithmetic number, because the mean of its divisors is an integer number (1271687088720).
Almost surely, 210001322113021 is an apocalyptic number.
It is an amenable number.
10001322113021 is a deficient number, since it is larger than the sum of its proper divisors (172174596739).
10001322113021 is an equidigital number, since it uses as much as digits as its factorization.
10001322113021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44344435.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10001322113021 its reverse (12031122310001), we get a palindrome (22032444423022).
The spelling of 10001322113021 in words is "ten trillion, one billion, three hundred twenty-two million, one hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •