Base | Representation |
---|---|
bin | 11101101110001000111… |
… | …01101000111001111101 |
3 | 10121121220102021101000022 |
4 | 32313010131220321331 |
5 | 113212411024300323 |
6 | 2101045003541525 |
7 | 133531241165231 |
oct | 16670435507175 |
9 | 3547812241008 |
10 | 1021203353213 |
11 | 3640a9740aaa |
12 | 145abab2a8a5 |
13 | 753b706cca4 |
14 | 375d84925c1 |
15 | 1b86ce814c8 |
hex | edc4768e7d |
1021203353213 has 8 divisors (see below), whose sum is σ = 1051209475008. Its totient is φ = 991481649984.
The previous prime is 1021203353207. The next prime is 1021203353221. The reversal of 1021203353213 is 3123533021201.
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 1021203353213 - 28 = 1021203352957 is a prime.
It is a super-2 number, since 2×10212033532132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021203353293) 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, 71097356 + ... + 71111717.
It is an arithmetic number, because the mean of its divisors is an integer number (131401184376).
Almost surely, 21021203353213 is an apocalyptic number.
It is an amenable number.
1021203353213 is a deficient number, since it is larger than the sum of its proper divisors (30006121795).
1021203353213 is a wasteful number, since it uses less digits than its factorization.
1021203353213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142209283.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 1021203353213 its reverse (3123533021201), we get a palindrome (4144736374414).
The spelling of 1021203353213 in words is "one trillion, twenty-one billion, two hundred three million, three hundred fifty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •