Base | Representation |
---|---|
bin | 11101110010000101011… |
… | …00001101011100100001 |
3 | 10121211101000012011100202 |
4 | 32321002230031130201 |
5 | 113231230200231423 |
6 | 2102035054354545 |
7 | 133634564564252 |
oct | 16710254153441 |
9 | 3554330164322 |
10 | 1023321102113 |
11 | 364a960a2102 |
12 | 1463b01bba55 |
13 | 75663a3374b |
14 | 3775983cb29 |
15 | 1b943d52728 |
hex | ee42b0d721 |
1023321102113 has 8 divisors (see below), whose sum is σ = 1069709986368. Its totient is φ = 977090273104.
The previous prime is 1023321102101. The next prime is 1023321102121. The reversal of 1023321102113 is 3112011233201.
It is a happy number.
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 1023321102113 - 212 = 1023321098017 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1023321102173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39500570 + ... + 39526467.
It is an arithmetic number, because the mean of its divisors is an integer number (133713748296).
Almost surely, 21023321102113 is an apocalyptic number.
It is an amenable number.
1023321102113 is a deficient number, since it is larger than the sum of its proper divisors (46388884255).
1023321102113 is an equidigital number, since it uses as much as digits as its factorization.
1023321102113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79027623.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1023321102113 its reverse (3112011233201), we get a palindrome (4135332335314).
The spelling of 1023321102113 in words is "one trillion, twenty-three billion, three hundred twenty-one million, one hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •