Base | Representation |
---|---|
bin | 10111000010011010110100… |
… | …001110111000010010111001 |
3 | 111021202012222202201120010212 |
4 | 113002122310032320102321 |
5 | 101240022011342441441 |
6 | 555254210320520505 |
7 | 30225136216401113 |
oct | 2702326416702271 |
9 | 437665882646125 |
10 | 101321302312121 |
11 | 2a3141397947a1 |
12 | b4448b7180135 |
13 | 446c7336824a8 |
14 | 1b03d976063b3 |
15 | baa8ed95aeeb |
hex | 5c26b43b84b9 |
101321302312121 has 16 divisors (see below), whose sum is σ = 102339169944576. Its totient is φ = 100308181311936.
The previous prime is 101321302312103. The next prime is 101321302312147. The reversal of 101321302312121 is 121213203123101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 101321302312121 - 26 = 101321302312057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101321302312621) 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, 1598928380 + ... + 1598991746.
It is an arithmetic number, because the mean of its divisors is an integer number (6396198121536).
Almost surely, 2101321302312121 is an apocalyptic number.
It is an amenable number.
101321302312121 is a deficient number, since it is larger than the sum of its proper divisors (1017867632455).
101321302312121 is a wasteful number, since it uses less digits than its factorization.
101321302312121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100568.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 101321302312121 its reverse (121213203123101), we get a palindrome (222534505435222).
The spelling of 101321302312121 in words is "one hundred one trillion, three hundred twenty-one billion, three hundred two million, three hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •