Base | Representation |
---|---|
bin | 1001010001110010000110… |
… | …1010001000010011111101 |
3 | 1100010012212000222102021220 |
4 | 2110130201222020103331 |
5 | 2314113334134121341 |
6 | 33410154241343553 |
7 | 2102002031326623 |
oct | 224344152102375 |
9 | 40105760872256 |
10 | 10201112020221 |
11 | 32832a387a4a1 |
12 | 1189063937bb9 |
13 | 58cc64976615 |
14 | 273a44b9b513 |
15 | 12a54ad24a66 |
hex | 94721a884fd |
10201112020221 has 8 divisors (see below), whose sum is σ = 13603800229920. Its totient is φ = 6799582578672.
The previous prime is 10201112020193. The next prime is 10201112020277. The reversal of 10201112020221 is 12202021110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10201112020221 - 25 = 10201112020189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10201112020221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201112020621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 289671495 + ... + 289706708.
It is an arithmetic number, because the mean of its divisors is an integer number (1700475028740).
Almost surely, 210201112020221 is an apocalyptic number.
It is an amenable number.
10201112020221 is a deficient number, since it is larger than the sum of its proper divisors (3402688209699).
10201112020221 is an equidigital number, since it uses as much as digits as its factorization.
10201112020221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 579384075.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10201112020221 its reverse (12202021110201), we get a palindrome (22403133130422).
The spelling of 10201112020221 in words is "ten trillion, two hundred one billion, one hundred twelve million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •