Base | Representation |
---|---|
bin | 10110111111001101110101… |
… | …010011011110011101011000 |
3 | 111020222011212200110012222201 |
4 | 112333031311103132131120 |
5 | 101222420231011022222 |
6 | 555005130201255544 |
7 | 30203215031106601 |
oct | 2677156523363530 |
9 | 436864780405881 |
10 | 101101203220312 |
11 | 2a239863573419 |
12 | b40a1104945b4 |
13 | 4454a582a23a9 |
14 | 1ad7478006da8 |
15 | ba4d1abe5427 |
hex | 5bf3754de758 |
101101203220312 has 32 divisors (see below), whose sum is σ = 189596829185280. Its totient is φ = 50542049528320.
The previous prime is 101101203220289. The next prime is 101101203220319. The reversal of 101101203220312 is 213022302101101.
It is a self number, because there is not a number n which added to its sum of digits gives 101101203220312.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101203220319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1564686918 + ... + 1564751530.
It is an arithmetic number, because the mean of its divisors is an integer number (5924900912040).
Almost surely, 2101101203220312 is an apocalyptic number.
It is an amenable number.
101101203220312 is a deficient number, since it is larger than the sum of its proper divisors (88495625964968).
101101203220312 is a wasteful number, since it uses less digits than its factorization.
101101203220312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94683 (or 94679 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 101101203220312 its reverse (213022302101101), we get a palindrome (314123505321413).
The spelling of 101101203220312 in words is "one hundred one trillion, one hundred one billion, two hundred three million, two hundred twenty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •