Base | Representation |
---|---|
bin | 10111000010011011110000… |
… | …010100001010101011011101 |
3 | 111021202022121000111020020011 |
4 | 113002123300110022223131 |
5 | 101240031042421043401 |
6 | 555254454330123221 |
7 | 30225203206411006 |
oct | 2702336024125335 |
9 | 437668530436204 |
10 | 101322310331101 |
11 | 2a314606795332 |
12 | b444b38880511 |
13 | 446c864469622 |
14 | 1b040514401ad |
15 | baa95c1c3451 |
hex | 5c26f050aadd |
101322310331101 has 16 divisors (see below), whose sum is σ = 101799556657344. Its totient is φ = 100846243217664.
The previous prime is 101322310331087. The next prime is 101322310331107. The reversal of 101322310331101 is 101133013223101.
It is a cyclic number.
It is not a de Polignac number, because 101322310331101 - 25 = 101322310331069 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 (101322310331107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 513594186 + ... + 513791428.
It is an arithmetic number, because the mean of its divisors is an integer number (6362472291084).
Almost surely, 2101322310331101 is an apocalyptic number.
It is an amenable number.
101322310331101 is a deficient number, since it is larger than the sum of its proper divisors (477246326243).
101322310331101 is a wasteful number, since it uses less digits than its factorization.
101322310331101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200220.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 101322310331101 its reverse (101133013223101), we get a palindrome (202455323554202).
The spelling of 101322310331101 in words is "one hundred one trillion, three hundred twenty-two billion, three hundred ten million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •