Search a number
-
+
10201111022001 = 342011613950153
BaseRepresentation
bin1001010001110010000110…
…0110010100100110110001
31100010012211222002200222210
42110130201212110212301
52314113333410201001
633410154204122333
72102002020001434
oct224344146244661
940105758080883
1010201111022001
1132832a3258519
1211890635363a9
1358cc646b7163
14273a449bb81b
1512a54abc8dd6
hex947219949b1

10201111022001 has 16 divisors (see below), whose sum is σ = 13605833292480. Its totient is φ = 6798564998400.

The previous prime is 10201111021999. The next prime is 10201111022041. The reversal of 10201111022001 is 10022011110201.

It is not a de Polignac number, because 10201111022001 - 21 = 10201111021999 is a prime.

It is not an unprimeable number, because it can be changed into a prime (10201111022041) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 203374741 + ... + 203424893.

It is an arithmetic number, because the mean of its divisors is an integer number (850364580780).

Almost surely, 210201111022001 is an apocalyptic number.

It is an amenable number.

10201111022001 is a deficient number, since it is larger than the sum of its proper divisors (3404722270479).

10201111022001 is a wasteful number, since it uses less digits than its factorization.

10201111022001 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 70496.

The product of its (nonzero) digits is 8, while the sum is 12.

Adding to 10201111022001 its reverse (10022011110201), we get a palindrome (20223122132202).

The spelling of 10201111022001 in words is "ten trillion, two hundred one billion, one hundred eleven million, twenty-two thousand, one".

Divisors: 1 3 4201 12603 16139 48417 50153 150459 67799939 203399817 210692753 632078259 809419267 2428257801 3400370340667 10201111022001