Base | Representation |
---|---|
bin | 11101101110010101101… |
… | …01010011100000100011 |
3 | 10121122011212100210010102 |
4 | 32313022311103200203 |
5 | 113213120404022243 |
6 | 2101103342253015 |
7 | 133534006431161 |
oct | 16671265234043 |
9 | 3548155323112 |
10 | 1021310220323 |
11 | 364153aa2928 |
12 | 145b2a88716b |
13 | 75403249373 |
14 | 37608750231 |
15 | 1b8775409b8 |
hex | edcad53823 |
1021310220323 has 8 divisors (see below), whose sum is σ = 1028006816448. Its totient is φ = 1014616047744.
The previous prime is 1021310220313. The next prime is 1021310220389. The reversal of 1021310220323 is 3230220131201.
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 1021310220323 - 220 = 1021309171747 is a prime.
It is a super-2 number, since 2×10213102203232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1021310220295 and 1021310220304.
It is not an unprimeable number, because it can be changed into a prime (1021310220313) 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, 243590 + ... + 1449812.
It is an arithmetic number, because the mean of its divisors is an integer number (128500852056).
Almost surely, 21021310220323 is an apocalyptic number.
1021310220323 is a deficient number, since it is larger than the sum of its proper divisors (6696596125).
1021310220323 is a wasteful number, since it uses less digits than its factorization.
1021310220323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1211773.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1021310220323 its reverse (3230220131201), we get a palindrome (4251530351524).
The spelling of 1021310220323 in words is "one trillion, twenty-one billion, three hundred ten million, two hundred twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •