Base | Representation |
---|---|
bin | 101111010001110111… |
… | …1011000001111100111 |
3 | 100201001220011012010202 |
4 | 1132203233120033213 |
5 | 3130414011312322 |
6 | 114350505141115 |
7 | 10223020161452 |
oct | 1364357301747 |
9 | 321056135122 |
10 | 101531354087 |
11 | 3a071891099 |
12 | 1781678a79b |
13 | 9760b5c117 |
14 | 4cb25a6499 |
15 | 29938c9292 |
hex | 17a3bd83e7 |
101531354087 has 8 divisors (see below), whose sum is σ = 105096516096. Its totient is φ = 98009406432.
The previous prime is 101531354069. The next prime is 101531354147. The reversal of 101531354087 is 780453135101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101531354087 - 28 = 101531353831 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 101531354087.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101531054087) 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 7 ways as a sum of consecutive naturals, for example, 10798808 + ... + 10808205.
It is an arithmetic number, because the mean of its divisors is an integer number (13137064512).
Almost surely, 2101531354087 is an apocalyptic number.
101531354087 is a deficient number, since it is larger than the sum of its proper divisors (3565162009).
101531354087 is a wasteful number, since it uses less digits than its factorization.
101531354087 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21607177.
The product of its (nonzero) digits is 50400, while the sum is 38.
Adding to 101531354087 its reverse (780453135101), we get a palindrome (881984489188).
The spelling of 101531354087 in words is "one hundred one billion, five hundred thirty-one million, three hundred fifty-four thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •