Base | Representation |
---|---|
bin | 10111000000111101100000… |
… | …111010011101000111110001 |
3 | 111021101122101220102000200021 |
4 | 113000331200322131013301 |
5 | 101231401323232414301 |
6 | 555140201330323441 |
7 | 30214661501453020 |
oct | 2700754072350761 |
9 | 437348356360607 |
10 | 101221120201201 |
11 | 2a2856aa585000 |
12 | b4293b8429581 |
13 | 4463159210110 |
14 | 1add1b22dc8b7 |
15 | ba7ed874c8a1 |
hex | 5c0f60e9d1f1 |
101221120201201 has 32 divisors (see below), whose sum is σ = 137028464568576. Its totient is φ = 72806400057600.
The previous prime is 101221120201183. The next prime is 101221120201261. The reversal of 101221120201201 is 102102021122101.
It is a de Polignac number, because none of the positive numbers 2k-101221120201201 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101221120201261) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 417730120 + ... + 417972361.
It is an arithmetic number, because the mean of its divisors is an integer number (4282139517768).
Almost surely, 2101221120201201 is an apocalyptic number.
101221120201201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101221120201201 is a deficient number, since it is larger than the sum of its proper divisors (35807344367375).
101221120201201 is an equidigital number, since it uses as much as digits as its factorization.
101221120201201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 835702534 (or 835702512 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101221120201201 its reverse (102102021122101), we get a palindrome (203323141323302).
The spelling of 101221120201201 in words is "one hundred one trillion, two hundred twenty-one billion, one hundred twenty million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •