Base | Representation |
---|---|
bin | 11101001000111001100… |
… | …01100000111100010001 |
3 | 10112201022001110222210102 |
4 | 32210130301200330101 |
5 | 112400434242401001 |
6 | 2043541035342145 |
7 | 132222630422345 |
oct | 16443461407421 |
9 | 3481261428712 |
10 | 1001210122001 |
11 | 35667a015521 |
12 | 14205b2b1955 |
13 | 7354bbc526b |
14 | 3665d04d625 |
15 | 1b09cb00e6b |
hex | e91cc60f11 |
1001210122001 has 12 divisors (see below), whose sum is σ = 1058120687412. Its totient is φ = 947220584544.
The previous prime is 1001210121983. The next prime is 1001210122013. The reversal of 1001210122001 is 1002210121001.
It can be written as a sum of positive squares in 2 ways, for example, as 870834244225 + 130375877776 = 933185^2 + 361076^2 .
It is not a de Polignac number, because 1001210122001 - 26 = 1001210121937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001210122021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1627226 + ... + 2156451.
It is an arithmetic number, because the mean of its divisors is an integer number (88176723951).
Almost surely, 21001210122001 is an apocalyptic number.
It is an amenable number.
1001210122001 is a deficient number, since it is larger than the sum of its proper divisors (56910565411).
1001210122001 is an equidigital number, since it uses as much as digits as its factorization.
1001210122001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3784448 (or 3784429 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1001210122001 its reverse (1002210121001), we get a palindrome (2003420243002).
It can be divided in two parts, 1001210 and 122001, that added together give a palindrome (1123211).
The spelling of 1001210122001 in words is "one trillion, one billion, two hundred ten million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •