Base | Representation |
---|---|
bin | 101111111110010101… |
… | …1001111110011000111 |
3 | 100211220212210011112101 |
4 | 1133330223033303013 |
5 | 3141443000140033 |
6 | 115154525532531 |
7 | 10305005550355 |
oct | 1377453176307 |
9 | 324825704471 |
10 | 103023443143 |
11 | 3a768058745 |
12 | 17b72414147 |
13 | 993b01165a |
14 | 4db480a7d5 |
15 | 2a2e8ae97d |
hex | 17fcacfcc7 |
103023443143 has 4 divisors (see below), whose sum is σ = 104327537440. Its totient is φ = 101719348848.
The previous prime is 103023443111. The next prime is 103023443147. The reversal of 103023443143 is 341344320301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341344320301 = 43 ⋅7938240007.
It is a cyclic number.
It is not a de Polignac number, because 103023443143 - 25 = 103023443111 is a prime.
It is a super-2 number, since 2×1030234431432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103023443147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 652047030 + ... + 652047187.
It is an arithmetic number, because the mean of its divisors is an integer number (26081884360).
Almost surely, 2103023443143 is an apocalyptic number.
103023443143 is a deficient number, since it is larger than the sum of its proper divisors (1304094297).
103023443143 is an equidigital number, since it uses as much as digits as its factorization.
103023443143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1304094296.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 103023443143 its reverse (341344320301), we get a palindrome (444367763444).
The spelling of 103023443143 in words is "one hundred three billion, twenty-three million, four hundred forty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •