Base | Representation |
---|---|
bin | 101111000101011000… |
… | …0100011010110011011 |
3 | 100122222200111112210102 |
4 | 1132022300203112123 |
5 | 3124034212400243 |
6 | 114241134010015 |
7 | 10206440533265 |
oct | 1361260432633 |
9 | 318880445712 |
10 | 101112231323 |
11 | 39977244a44 |
12 | 1771a34690b |
13 | 96c508379c |
14 | 4c72a64b35 |
15 | 296bbd99b8 |
hex | 178ac2359b |
101112231323 has 8 divisors (see below), whose sum is σ = 101380390800. Its totient is φ = 100844140320.
The previous prime is 101112231299. The next prime is 101112231349. The reversal of 101112231323 is 323132211101.
It is a happy number.
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 101112231323 - 220 = 101111182747 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101112231295 and 101112231304.
It is not an unprimeable number, because it can be changed into a prime (101112231223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4474433 + ... + 4496973.
It is an arithmetic number, because the mean of its divisors is an integer number (12672548850).
Almost surely, 2101112231323 is an apocalyptic number.
101112231323 is a deficient number, since it is larger than the sum of its proper divisors (268159477).
101112231323 is a wasteful number, since it uses less digits than its factorization.
101112231323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34237.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 101112231323 its reverse (323132211101), we get a palindrome (424244442424).
The spelling of 101112231323 in words is "one hundred one billion, one hundred twelve million, two hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •