Base | Representation |
---|---|
bin | 101111001011010011… |
… | …1101011100001111011 |
3 | 100200111112221211120102 |
4 | 1132112213223201323 |
5 | 3124441133411443 |
6 | 114313003150015 |
7 | 10214405156453 |
oct | 1362647534173 |
9 | 320445854512 |
10 | 101311232123 |
11 | 39a69605212 |
12 | 17774b1530b |
13 | 972737b03a |
14 | 4c91266d63 |
15 | 297e3e7cb8 |
hex | 17969eb87b |
101311232123 has 4 divisors (see below), whose sum is σ = 101877216840. Its totient is φ = 100745247408.
The previous prime is 101311232107. The next prime is 101311232137. The reversal of 101311232123 is 321232113101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101311232123 - 24 = 101311232107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101311232095 and 101311232104.
It is not an unprimeable number, because it can be changed into a prime (101311232423) 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 3 ways as a sum of consecutive naturals, for example, 282992090 + ... + 282992447.
It is an arithmetic number, because the mean of its divisors is an integer number (25469304210).
Almost surely, 2101311232123 is an apocalyptic number.
101311232123 is a deficient number, since it is larger than the sum of its proper divisors (565984717).
101311232123 is an equidigital number, since it uses as much as digits as its factorization.
101311232123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565984716.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 101311232123 its reverse (321232113101), we get a palindrome (422543345224).
The spelling of 101311232123 in words is "one hundred one billion, three hundred eleven million, two hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •