Base | Representation |
---|---|
bin | 10111000000111110010110… |
… | …100111100100101010011101 |
3 | 111021101201201200211120111201 |
4 | 113000332112213210222131 |
5 | 101231410144413033041 |
6 | 555140430554315501 |
7 | 30215023022136661 |
oct | 2700762647445235 |
9 | 437351650746451 |
10 | 101222021221021 |
11 | 2a286022143588 |
12 | b42960a128b91 |
13 | 4463270aa2a3c |
14 | 1add259c428a1 |
15 | ba803c8cb631 |
hex | 5c0f969e4a9d |
101222021221021 has 16 divisors (see below), whose sum is σ = 108777513147264. Its totient is φ = 93854031335424.
The previous prime is 101222021221001. The next prime is 101222021221037. The reversal of 101222021221021 is 120122120222101.
It is not a de Polignac number, because 101222021221021 - 219 = 101222020696733 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101222021221021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101222021221001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 149424031 + ... + 150099916.
It is an arithmetic number, because the mean of its divisors is an integer number (6798594571704).
Almost surely, 2101222021221021 is an apocalyptic number.
It is an amenable number.
101222021221021 is a deficient number, since it is larger than the sum of its proper divisors (7555491926243).
101222021221021 is a wasteful number, since it uses less digits than its factorization.
101222021221021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299524260.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 101222021221021 its reverse (120122120222101), we get a palindrome (221344141443122).
The spelling of 101222021221021 in words is "one hundred one trillion, two hundred twenty-two billion, twenty-one million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.662 sec. • engine limits •