Base | Representation |
---|---|
bin | 10111000011111001110101… |
… | …001001000100100110001111 |
3 | 111022002222022202201112010011 |
4 | 113003321311021010212033 |
5 | 101243204431144241033 |
6 | 555413121551054051 |
7 | 30235410331312006 |
oct | 2703716511044617 |
9 | 438088282645104 |
10 | 101423323040143 |
11 | 2a353431834755 |
12 | b460629811327 |
13 | 4479241a15b90 |
14 | 1b08cb4b99c3d |
15 | bad3c029eccd |
hex | 5c3e7524498f |
101423323040143 has 64 divisors (see below), whose sum is σ = 113561387976960. Its totient is φ = 89994641338368.
The previous prime is 101423323040089. The next prime is 101423323040159. The reversal of 101423323040143 is 341040323324101.
It is a de Polignac number, because none of the positive numbers 2k-101423323040143 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101423323040183) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11477117121 + ... + 11477125957.
It is an arithmetic number, because the mean of its divisors is an integer number (1774396687140).
Almost surely, 2101423323040143 is an apocalyptic number.
101423323040143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
101423323040143 is a deficient number, since it is larger than the sum of its proper divisors (12138064936817).
101423323040143 is a wasteful number, since it uses less digits than its factorization.
101423323040143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10468.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 101423323040143 its reverse (341040323324101), we get a palindrome (442463646364244).
The spelling of 101423323040143 in words is "one hundred one trillion, four hundred twenty-three billion, three hundred twenty-three million, forty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •