Base | Representation |
---|---|
bin | 101111000101011000… |
… | …0100011010001101111 |
3 | 100122222200111112101022 |
4 | 1132022300203101233 |
5 | 3124034212343043 |
6 | 114241134004355 |
7 | 10206440532356 |
oct | 1361260432157 |
9 | 318880445338 |
10 | 101112231023 |
11 | 399772447a1 |
12 | 1771a3466bb |
13 | 96c50835cb |
14 | 4c72a6499d |
15 | 296bbd9868 |
hex | 178ac2346f |
101112231023 has 4 divisors (see below), whose sum is σ = 102039866280. Its totient is φ = 100184595768.
The previous prime is 101112230983. The next prime is 101112231029. The reversal of 101112231023 is 320132211101.
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 101112231023 - 224 = 101095453807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101112230992 and 101112231010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101112231029) 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 3 ways as a sum of consecutive naturals, for example, 463817465 + ... + 463817682.
It is an arithmetic number, because the mean of its divisors is an integer number (25509966570).
Almost surely, 2101112231023 is an apocalyptic number.
101112231023 is a deficient number, since it is larger than the sum of its proper divisors (927635257).
101112231023 is an equidigital number, since it uses as much as digits as its factorization.
101112231023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 927635256.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 101112231023 its reverse (320132211101), we get a palindrome (421244442124).
The spelling of 101112231023 in words is "one hundred one billion, one hundred twelve million, two hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •