Base | Representation |
---|---|
bin | 10111000001010001001010… |
… | …100100111100111110000101 |
3 | 111021110122212101222012210221 |
4 | 113001101022210330332011 |
5 | 101232223031344132323 |
6 | 555154011154544341 |
7 | 30216336412403344 |
oct | 2701211244747605 |
9 | 437418771865727 |
10 | 101242220302213 |
11 | 2a293647a88211 |
12 | b4315068980b1 |
13 | 446513c7a26a3 |
14 | 1b0021474bb5b |
15 | ba8820d6e55d |
hex | 5c144a93cf85 |
101242220302213 has 8 divisors (see below), whose sum is σ = 101523897530528. Its totient is φ = 100960597889424.
The previous prime is 101242220302127. The next prime is 101242220302247. The reversal of 101242220302213 is 312203022242101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101242220302213 - 225 = 101242186747781 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101242220342213) 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, 10003431 + ... + 17394052.
It is an arithmetic number, because the mean of its divisors is an integer number (12690487191316).
Almost surely, 2101242220302213 is an apocalyptic number.
It is an amenable number.
101242220302213 is a deficient number, since it is larger than the sum of its proper divisors (281677228315).
101242220302213 is an equidigital number, since it uses as much as digits as its factorization.
101242220302213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27407763.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 101242220302213 its reverse (312203022242101), we get a palindrome (413445242544314).
The spelling of 101242220302213 in words is "one hundred one trillion, two hundred forty-two billion, two hundred twenty million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •