Base | Representation |
---|---|
bin | 11101101110001000111… |
… | …01100000110011000001 |
3 | 10121121220102012200110020 |
4 | 32313010131200303001 |
5 | 113212411022220001 |
6 | 2101045003124053 |
7 | 133531240666344 |
oct | 16670435406301 |
9 | 3547812180406 |
10 | 1021203320001 |
11 | 3640a9719057 |
12 | 145abab13629 |
13 | 753b705ab37 |
14 | 375d848445b |
15 | 1b86ce76736 |
hex | edc4760cc1 |
1021203320001 has 4 divisors (see below), whose sum is σ = 1361604426672. Its totient is φ = 680802213332.
The previous prime is 1021203319991. The next prime is 1021203320057. The reversal of 1021203320001 is 1000233021201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1021203320001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1021203320801) 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 3 ways as a sum of consecutive naturals, for example, 170200553331 + ... + 170200553336.
It is an arithmetic number, because the mean of its divisors is an integer number (340401106668).
Almost surely, 21021203320001 is an apocalyptic number.
It is an amenable number.
1021203320001 is a deficient number, since it is larger than the sum of its proper divisors (340401106671).
1021203320001 is an equidigital number, since it uses as much as digits as its factorization.
1021203320001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340401106670.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1021203320001 its reverse (1000233021201), we get a palindrome (2021436341202).
The spelling of 1021203320001 in words is "one trillion, twenty-one billion, two hundred three million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •