Base | Representation |
---|---|
bin | 11101101110001000101… |
… | …01011011011101111101 |
3 | 10121121220021020000202111 |
4 | 32313010111123131331 |
5 | 113212410001413041 |
6 | 2101044445454021 |
7 | 133531213662511 |
oct | 16670425333575 |
9 | 3547807200674 |
10 | 1021201201021 |
11 | 3640a8501031 |
12 | 145aba271311 |
13 | 753b67984c1 |
14 | 375d8092141 |
15 | 1b86cba8981 |
hex | edc455b77d |
1021201201021 has 4 divisors (see below), whose sum is σ = 1021396576672. Its totient is φ = 1021005825372.
The previous prime is 1021201201019. The next prime is 1021201201043. The reversal of 1021201201021 is 1201021021201.
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 not a de Polignac number, because 1021201201021 - 21 = 1021201201019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1021201200992 and 1021201201010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021201201121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 97679985 + ... + 97690438.
It is an arithmetic number, because the mean of its divisors is an integer number (255349144168).
Almost surely, 21021201201021 is an apocalyptic number.
It is an amenable number.
1021201201021 is a deficient number, since it is larger than the sum of its proper divisors (195375651).
1021201201021 is an equidigital number, since it uses as much as digits as its factorization.
1021201201021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195375650.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1021201201021 its reverse (1201021021201), we get a palindrome (2222222222222).
The spelling of 1021201201021 in words is "one trillion, twenty-one billion, two hundred one million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •