Base | Representation |
---|---|
bin | 11101101011111011111… |
… | …11110010000010110001 |
3 | 10121111212000200202120111 |
4 | 32311331333302002301 |
5 | 113203000401334301 |
6 | 2100331412341321 |
7 | 133460034321535 |
oct | 16657577620261 |
9 | 3544760622514 |
10 | 1020021121201 |
11 | 363652370655 |
12 | 14582b014841 |
13 | 7525915a014 |
14 | 37525469bc5 |
15 | 1b7ee2a5551 |
hex | ed7dff20b1 |
1020021121201 has 4 divisors (see below), whose sum is σ = 1022205321072. Its totient is φ = 1017836921332.
The previous prime is 1020021121129. The next prime is 1020021121237. The reversal of 1020021121201 is 1021211200201.
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 1020021121201 - 217 = 1020020990129 is a prime.
It is a super-2 number, since 2×10200211212012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020021121271) 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, 1092099235 + ... + 1092100168.
It is an arithmetic number, because the mean of its divisors is an integer number (255551330268).
Almost surely, 21020021121201 is an apocalyptic number.
It is an amenable number.
1020021121201 is a deficient number, since it is larger than the sum of its proper divisors (2184199871).
1020021121201 is an equidigital number, since it uses as much as digits as its factorization.
1020021121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2184199870.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1020021121201 its reverse (1021211200201), we get a palindrome (2041232321402).
The spelling of 1020021121201 in words is "one trillion, twenty billion, twenty-one million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •