Base | Representation |
---|---|
bin | 11101101100001000000… |
… | …00101001000110010001 |
3 | 10121112010001112102222201 |
4 | 32312010000221012101 |
5 | 113203202213310001 |
6 | 2100345415003201 |
7 | 133462401005143 |
oct | 16660400510621 |
9 | 3545101472881 |
10 | 1020122010001 |
11 | 3636a4309926 |
12 | 145858969501 |
13 | 75274022233 |
14 | 37534a0cc93 |
15 | 1b808083501 |
hex | ed84029191 |
1020122010001 has 4 divisors (see below), whose sum is σ = 1021933950192. Its totient is φ = 1018310069812.
The previous prime is 1020122009911. The next prime is 1020122010049. The reversal of 1020122010001 is 1000102210201.
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 1020122010001 - 223 = 1020113621393 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1020122010001.
It is not an unprimeable number, because it can be changed into a prime (1020122014001) 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, 905969251 + ... + 905970376.
It is an arithmetic number, because the mean of its divisors is an integer number (255483487548).
Almost surely, 21020122010001 is an apocalyptic number.
It is an amenable number.
1020122010001 is a deficient number, since it is larger than the sum of its proper divisors (1811940191).
1020122010001 is an equidigital number, since it uses as much as digits as its factorization.
1020122010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1811940190.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1020122010001 its reverse (1000102210201), we get a palindrome (2020224220202).
The spelling of 1020122010001 in words is "one trillion, twenty billion, one hundred twenty-two million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •