Base | Representation |
---|---|
bin | 10111000010011010101111… |
… | …010110000100011111100001 |
3 | 111021202012210001102110202122 |
4 | 113002122233112010133201 |
5 | 101240021324344423014 |
6 | 555254154231154025 |
7 | 30225134202401606 |
oct | 2702325726043741 |
9 | 437665701373678 |
10 | 101321220311009 |
11 | 2a3140a7477086 |
12 | b444893815915 |
13 | 446c71c6a131a |
14 | 1b03d8a77c6ad |
15 | baa8e665e58e |
hex | 5c26af5847e1 |
101321220311009 has 4 divisors (see below), whose sum is σ = 104059631670804. Its totient is φ = 98582808951216.
The previous prime is 101321220310997. The next prime is 101321220311023. The reversal of 101321220311009 is 900113022123101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 83110517551009 + 18210702760000 = 9116497^2 + 4267400^2 .
It is a cyclic number.
It is not a de Polignac number, because 101321220311009 - 216 = 101321220245473 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101321220311209) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1369205679842 + ... + 1369205679915.
It is an arithmetic number, because the mean of its divisors is an integer number (26014907917701).
Almost surely, 2101321220311009 is an apocalyptic number.
It is an amenable number.
101321220311009 is a deficient number, since it is larger than the sum of its proper divisors (2738411359795).
101321220311009 is an equidigital number, since it uses as much as digits as its factorization.
101321220311009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2738411359794.
The product of its (nonzero) digits is 648, while the sum is 26.
The spelling of 101321220311009 in words is "one hundred one trillion, three hundred twenty-one billion, two hundred twenty million, three hundred eleven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •