Base | Representation |
---|---|
bin | 101111000101111100… |
… | …1000001110001100111 |
3 | 100200001000020210111122 |
4 | 1132023321001301213 |
5 | 3124104043332221 |
6 | 114243053124155 |
7 | 10210061163026 |
oct | 1361371016147 |
9 | 320030223448 |
10 | 101131230311 |
11 | 39986a41191 |
12 | 1772478965b |
13 | 96c8ca63a7 |
14 | 4c753ac8bd |
15 | 296d6ddeab |
hex | 178be41c67 |
101131230311 has 4 divisors (see below), whose sum is σ = 103483119432. Its totient is φ = 98779341192.
The previous prime is 101131230307. The next prime is 101131230323. The reversal of 101131230311 is 113032131101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113032131101 = 115013 ⋅982777.
It is a cyclic number.
It is not a de Polignac number, because 101131230311 - 22 = 101131230307 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101131230311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101131235311) 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, 1175944496 + ... + 1175944581.
It is an arithmetic number, because the mean of its divisors is an integer number (25870779858).
Almost surely, 2101131230311 is an apocalyptic number.
101131230311 is a deficient number, since it is larger than the sum of its proper divisors (2351889121).
101131230311 is an equidigital number, since it uses as much as digits as its factorization.
101131230311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2351889120.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 101131230311 its reverse (113032131101), we get a palindrome (214163361412).
The spelling of 101131230311 in words is "one hundred one billion, one hundred thirty-one million, two hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •