Base | Representation |
---|---|
bin | 10111000010011101010110… |
… | …010010010110001100011011 |
3 | 111021202111000020122211010202 |
4 | 113002131112102112030123 |
5 | 101240043043402130021 |
6 | 555255340202332415 |
7 | 30225263462100641 |
oct | 2702352622261433 |
9 | 437674006584122 |
10 | 101324021130011 |
11 | 2a315304463929 |
12 | b4453357ba10b |
13 | 446ca77a27284 |
14 | 1b04174737191 |
15 | baaa0c4aba0b |
hex | 5c275649631b |
101324021130011 has 8 divisors (see below), whose sum is σ = 106766706657600. Its totient is φ = 95892319833480.
The previous prime is 101324021129957. The next prime is 101324021130029. The reversal of 101324021130011 is 110031120423101.
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 101324021130011 - 222 = 101324016935707 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101324021130811) 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, 2746038821 + ... + 2746075718.
It is an arithmetic number, because the mean of its divisors is an integer number (13345838332200).
Almost surely, 2101324021130011 is an apocalyptic number.
101324021130011 is a deficient number, since it is larger than the sum of its proper divisors (5442685527589).
101324021130011 is an equidigital number, since it uses as much as digits as its factorization.
101324021130011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5492115529.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 101324021130011 its reverse (110031120423101), we get a palindrome (211355141553112).
The spelling of 101324021130011 in words is "one hundred one trillion, three hundred twenty-four billion, twenty-one million, one hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •