Base | Representation |
---|---|
bin | 1001010001110101011010… |
… | …1001011001110000110001 |
3 | 1100010022010222210101110202 |
4 | 2110131112221121300301 |
5 | 2314122144230201001 |
6 | 33410422400004545 |
7 | 2102033044610555 |
oct | 224352651316061 |
9 | 40108128711422 |
10 | 10202001022001 |
11 | 328370a67a708 |
12 | 1189271600755 |
13 | 590076bbbc89 |
14 | 273acac93865 |
15 | 12a59ddcc96b |
hex | 94756a59c31 |
10202001022001 has 4 divisors (see below), whose sum is σ = 10208233156212. Its totient is φ = 10195768887792.
The previous prime is 10202001021983. The next prime is 10202001022027. The reversal of 10202001022001 is 10022010020201.
It is a happy number.
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 2222782810000 + 7979218212001 = 1490900^2 + 2824751^2 .
It is a cyclic number.
It is not a de Polignac number, because 10202001022001 - 26 = 10202001021937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10202001022201) 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, 3116064650 + ... + 3116067923.
It is an arithmetic number, because the mean of its divisors is an integer number (2552058289053).
Almost surely, 210202001022001 is an apocalyptic number.
It is an amenable number.
10202001022001 is a deficient number, since it is larger than the sum of its proper divisors (6232134211).
10202001022001 is an equidigital number, since it uses as much as digits as its factorization.
10202001022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6232134210.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 10202001022001 its reverse (10022010020201), we get a palindrome (20224011042202).
The spelling of 10202001022001 in words is "ten trillion, two hundred two billion, one million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •