Base | Representation |
---|---|
bin | 1011000011110100101… |
… | …1000001110010111111 |
3 | 200011102202200001222102 |
4 | 2300331023001302333 |
5 | 11103112221042033 |
6 | 223141555335315 |
7 | 16504332452255 |
oct | 2607513016277 |
9 | 604382601872 |
10 | 190004862143 |
11 | 73642878198 |
12 | 309a82b153b |
13 | 14bc0644b15 |
14 | 92a68665d5 |
15 | 4e20c26de8 |
hex | 2c3d2c1cbf |
190004862143 has 4 divisors (see below), whose sum is σ = 190989343488. Its totient is φ = 189020380800.
The previous prime is 190004862137. The next prime is 190004862197. The reversal of 190004862143 is 341268400091.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341268400091 = 5623 ⋅60691517.
It is a cyclic number.
It is not a de Polignac number, because 190004862143 - 230 = 188931120319 is a prime.
It is a super-2 number, since 2×1900048621432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 190004862097 and 190004862106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (190004862643) 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, 492240383 + ... + 492240768.
It is an arithmetic number, because the mean of its divisors is an integer number (47747335872).
Almost surely, 2190004862143 is an apocalyptic number.
190004862143 is a deficient number, since it is larger than the sum of its proper divisors (984481345).
190004862143 is an equidigital number, since it uses as much as digits as its factorization.
190004862143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 984481344.
The product of its (nonzero) digits is 41472, while the sum is 38.
The spelling of 190004862143 in words is "one hundred ninety billion, four million, eight hundred sixty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •