Base | Representation |
---|---|
bin | 1001010010111000011110… |
… | …0010010000100010110001 |
3 | 1100012000121110010012020101 |
4 | 2110232013202100202301 |
5 | 2314421030240231001 |
6 | 33423000444112401 |
7 | 2103241104015115 |
oct | 224560742204261 |
9 | 40160543105211 |
10 | 10220001102001 |
11 | 3290307207189 |
12 | 1190855835701 |
13 | 591985149aa2 |
14 | 274917701745 |
15 | 12aca429ea01 |
hex | 94b878908b1 |
10220001102001 has 4 divisors (see below), whose sum is σ = 10469269421604. Its totient is φ = 9970732782400.
The previous prime is 10220001101957. The next prime is 10220001102007. The reversal of 10220001102001 is 10020110002201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 367157224225 + 9852843877776 = 605935^2 + 3138924^2 .
It is a cyclic number.
It is not a de Polignac number, because 10220001102001 - 215 = 10220001069233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10220001102007) 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, 124634159740 + ... + 124634159821.
It is an arithmetic number, because the mean of its divisors is an integer number (2617317355401).
Almost surely, 210220001102001 is an apocalyptic number.
It is an amenable number.
10220001102001 is a deficient number, since it is larger than the sum of its proper divisors (249268319603).
10220001102001 is an equidigital number, since it uses as much as digits as its factorization.
10220001102001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249268319602.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10220001102001 its reverse (10020110002201), we get a palindrome (20240111104202).
The spelling of 10220001102001 in words is "ten trillion, two hundred twenty billion, one million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •