Base | Representation |
---|---|
bin | 1001010010111001001111… |
… | …1111111010001000100001 |
3 | 1100012001011000120112022020 |
4 | 2110232103333322020201 |
5 | 2314421442302413441 |
6 | 33423033313532053 |
7 | 2103246223230414 |
oct | 224562377721041 |
9 | 40161130515266 |
10 | 10220210201121 |
11 | 3290404244478 |
12 | 11908b3874029 |
13 | 5919b956b88b |
14 | 2749373b1b7b |
15 | 12acb7804e66 |
hex | 94b93ffa221 |
10220210201121 has 32 divisors (see below), whose sum is σ = 14763292646400. Its totient is φ = 6268971360960.
The previous prime is 10220210201101. The next prime is 10220210201153. The reversal of 10220210201121 is 12110201202201.
It is not a de Polignac number, because 10220210201121 - 227 = 10220075983393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10220210201121.
It is not an unprimeable number, because it can be changed into a prime (10220210201101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18574966 + ... + 19117263.
It is an arithmetic number, because the mean of its divisors is an integer number (461352895200).
Almost surely, 210220210201121 is an apocalyptic number.
It is an amenable number.
10220210201121 is a deficient number, since it is larger than the sum of its proper divisors (4543082445279).
10220210201121 is a wasteful number, since it uses less digits than its factorization.
10220210201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37692389.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10220210201121 its reverse (12110201202201), we get a palindrome (22330411403322).
The spelling of 10220210201121 in words is "ten trillion, two hundred twenty billion, two hundred ten million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •