Base | Representation |
---|---|
bin | 10110111111101001111001… |
… | …110011010101110000011011 |
3 | 111021002001200012121200201220 |
4 | 112333221321303111300123 |
5 | 101223413442411000321 |
6 | 555031033043143123 |
7 | 30205332652625661 |
oct | 2677517163256033 |
9 | 437061605550656 |
10 | 101131343453211 |
11 | 2a25061a988505 |
12 | b413b22374aa3 |
13 | 445784c726826 |
14 | 1ad8ad6d16c31 |
15 | ba59d1cbe9c6 |
hex | 5bfa79cd5c1b |
101131343453211 has 8 divisors (see below), whose sum is σ = 135669041524800. Its totient is φ = 67007270508552.
The previous prime is 101131343453191. The next prime is 101131343453219. The reversal of 101131343453211 is 112354343131101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101131343453211 - 211 = 101131343451163 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101131343453219) 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, 103406281161 + ... + 103406282138.
It is an arithmetic number, because the mean of its divisors is an integer number (16958630190600).
Almost surely, 2101131343453211 is an apocalyptic number.
101131343453211 is a deficient number, since it is larger than the sum of its proper divisors (34537698071589).
101131343453211 is a wasteful number, since it uses less digits than its factorization.
101131343453211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206812563465.
The product of its (nonzero) digits is 12960, while the sum is 33.
Adding to 101131343453211 its reverse (112354343131101), we get a palindrome (213485686584312).
The spelling of 101131343453211 in words is "one hundred one trillion, one hundred thirty-one billion, three hundred forty-three million, four hundred fifty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •