Base | Representation |
---|---|
bin | 101111000011000001… |
… | …0101111001100000011 |
3 | 100122210011121212221002 |
4 | 1132012002233030003 |
5 | 3123403434043243 |
6 | 114225230122215 |
7 | 10204460166533 |
oct | 1360602571403 |
9 | 318704555832 |
10 | 101033112323 |
11 | 39936615740 |
12 | 176b795036b |
13 | 96b1871400 |
14 | 4c6634b4c3 |
15 | 2964cabeb8 |
hex | 17860af303 |
101033112323 has 24 divisors (see below), whose sum is σ = 119380884480. Its totient is φ = 84759972960.
The previous prime is 101033112317. The next prime is 101033112331. The reversal of 101033112323 is 323211330101.
It is not a de Polignac number, because 101033112323 - 212 = 101033108227 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101033112295 and 101033112304.
It is not an unprimeable number, because it can be changed into a prime (101033112623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12754358 + ... + 12762276.
It is an arithmetic number, because the mean of its divisors is an integer number (4974203520).
Almost surely, 2101033112323 is an apocalyptic number.
101033112323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
101033112323 is a deficient number, since it is larger than the sum of its proper divisors (18347772157).
101033112323 is a wasteful number, since it uses less digits than its factorization.
101033112323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14819 (or 14806 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 101033112323 its reverse (323211330101), we get a palindrome (424244442424).
The spelling of 101033112323 in words is "one hundred one billion, thirty-three million, one hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •