Base | Representation |
---|---|
bin | 101111000010111111… |
… | …0111111101101011111 |
3 | 100122210002210001101110 |
4 | 1132011332333231133 |
5 | 3123403211201143 |
6 | 114225153113103 |
7 | 10204445643006 |
oct | 1360576775537 |
9 | 318702701343 |
10 | 101032131423 |
11 | 39936005783 |
12 | 176b7558793 |
13 | 96b15b9ab2 |
14 | 4c66173c3d |
15 | 2964b66533 |
hex | 1785fbfb5f |
101032131423 has 8 divisors (see below), whose sum is σ = 135393313968. Its totient is φ = 67012851584.
The previous prime is 101032131359. The next prime is 101032131451. The reversal of 101032131423 is 324131230101.
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 101032131423 - 26 = 101032131359 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101032131423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101032131623) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 85474986 + ... + 85476167.
It is an arithmetic number, because the mean of its divisors is an integer number (16924164246).
Almost surely, 2101032131423 is an apocalyptic number.
101032131423 is a deficient number, since it is larger than the sum of its proper divisors (34361182545).
101032131423 is a wasteful number, since it uses less digits than its factorization.
101032131423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170951353.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 101032131423 its reverse (324131230101), we get a palindrome (425163361524).
The spelling of 101032131423 in words is "one hundred one billion, thirty-two million, one hundred thirty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •