Base | Representation |
---|---|
bin | 10111000010011010101111… |
… | …010101010011101101101101 |
3 | 111021202012210001001022200210 |
4 | 113002122233111103231231 |
5 | 101240021324322024323 |
6 | 555254154223013033 |
7 | 30225134200610244 |
oct | 2702325725235555 |
9 | 437665701038623 |
10 | 101321220111213 |
11 | 2a3140a734aa63 |
12 | b44489373a179 |
13 | 446c71c6313bb |
14 | 1b03d8a72995b |
15 | baa8e6620293 |
hex | 5c26af553b6d |
101321220111213 has 32 divisors (see below), whose sum is σ = 143569465804800. Its totient is φ = 63378733015296.
The previous prime is 101321220111197. The next prime is 101321220111269. The reversal of 101321220111213 is 312111022123101.
It is not a de Polignac number, because 101321220111213 - 24 = 101321220111197 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101321220111213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101321220113213) 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, 22841445 + ... + 26914197.
It is an arithmetic number, because the mean of its divisors is an integer number (4486545806400).
Almost surely, 2101321220111213 is an apocalyptic number.
It is an amenable number.
101321220111213 is a deficient number, since it is larger than the sum of its proper divisors (42248245693587).
101321220111213 is a wasteful number, since it uses less digits than its factorization.
101321220111213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4076961.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 101321220111213 its reverse (312111022123101), we get a palindrome (413432242234314).
The spelling of 101321220111213 in words is "one hundred one trillion, three hundred twenty-one billion, two hundred twenty million, one hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •